Paul Goldberg

Professor of Computer Science

Prof. Paul Goldberg obtained his PhD at the University of Edinburgh in 1993 (supervised by Mark Jerrum) in the general area of algorithmic learning theory. He spent three years at Sandia National Labs working mainly on algorithmic problems arising from biology, and before coming to Oxford, held permanent academic positions at the universities of Warwick and Liverpool.At Liverpool, he was founding head of the Economics and Computation (EcCo) Research Group. Since 2002, he has worked mainly in algorithmic game theory, and more recently is exploring the connections with machine learning (for example, revealed preferences theory). His paper "The complexity of computing a Nash equilibrium" (co-authored with Papadimitriou and Daskalakis) received the 2008 Game Theory and Computer Science Prize.

Published Research

Fearnley, J., Goldberg, P.W., Savani, R. and Sorensen, T.B (2016). Approximate well-supported Nash equilibria below two-thirds. Algorithmica. 76(2). 297-319.
Chen, N., Deng, X., Goldberg, P.W. and Zhang, J (2016). On revenue maximization with sharp multi-unit demands. Journal of Combinatorial Optimization. 31(3). 1174-1205.
Colini-Baldeschi, R., Goldberg, P., de Keijzer, B., Leonardi, S., Roughgarden, T. and Turchetta, S. (2017). Approximately efficient two-sided combinatorial auctions. Procedings of the 2017 Conference on Economics and Computatoin. na. 591-608.
Deng, X., Goldberg, P., Tang, B. and Zhang, J. (2016). Multi-unit Bayesian auction with demand or budget constraints. Computational intelligence. 32(3). 355-368.