Paul Goldberg
Paul Goldberg
Professor of Computer Science, Oxford University
Verified email at - Homepage
Cited by
Cited by
The complexity of computing a Nash equilibrium
C Daskalakis, PW Goldberg, CH Papadimitriou
SIAM Journal on Computing 39 (1), 195-259, 2009
Regression with input-dependent noise: A Gaussian process treatment
PW Goldberg, CKI Williams, CM Bishop
Advances in neural information processing systems 10, 493-499, 1997
Four strikes against physical mapping of DNA
PW Goldberg, MC Golumbic, H Kaplan, R Shamir
Journal of Computational Biology 2 (1), 139-152, 1995
Bounding the Vapnik-Chervonenkis dimension of concept classes parameterized by real numbers
PW Goldberg, MR Jerrum
Machine Learning 18 (2-3), 131-148, 1995
Reducibility among equilibrium problems
PW Goldberg, CH Papadimitriou
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing …, 2006
Distributed selfish load balancing
P Berenbrink, T Friedetzky, LA Goldberg, PW Goldberg, Z Hu, R Martin
SIAM Journal on Computing 37 (4), 1163-1181, 2007
Computational complexity of weighted threshold games
E Elkind, LA Goldberg, PW Goldberg, M Wooldridge
AAAI, 718-723, 2007
Uncoordinated two-sided matching markets
H Ackermann, PW Goldberg, VS Mirrokni, H Röglin, B Vöcking
SIAM Journal on Computing 40 (1), 92-106, 2011
Evolutionary trees can be learned in polynomial time in the two-state general Markov model
M Cryan, LA Goldberg, PW Goldberg
SIAM Journal on Computing 31 (2), 375-397, 2001
Bounds for the convergence rate of randomized local search in a multiplayer load-balancing game
PW Goldberg
Proceedings of the twenty-third annual ACM symposium on principles of …, 2004
Nash equilibria in graphical games on trees revisited
E Elkind, LA Goldberg, P Goldberg
Proceedings of the 7th ACM Conference on Electronic Commerce, 100-109, 2006
On the computational complexity of weighted voting games
E Elkind, LA Goldberg, PW Goldberg, M Wooldridge
Annals of Mathematics and Artificial Intelligence 56 (2), 109-131, 2009
A tractable and expressive class of marginal contribution nets and its applications
E Elkind, LA Goldberg, PW Goldberg, M Wooldridge
Mathematical Logic Quarterly 55 (4), 362-376, 2009
The complexity of the homotopy method, equilibrium selection, and Lemke-Howson solutions
PW Goldberg, CH Papadimitriou, R Savani
ACM Transactions on Economics and Computation (TEAC) 1 (2), 1-25, 2013
Learning equilibria of games via payoff queries.
J Fearnley, M Gairing, PW Goldberg, R Savani
J. Mach. Learn. Res. 16, 1305-1344, 2015
Decentralized dynamics for finite opinion games
D Ferraioli, PW Goldberg, C Ventre
Theoretical Computer Science 648, 96-115, 2016
Constructing computer virus phylogenies
LA Goldberg, PW Goldberg, CA Phillips, GB Sorkin
Journal of Algorithms 26 (1), 188-208, 1998
Bounds for the query complexity of approximate equilibria
PW Goldberg, A Roth
ACM Transactions on Economics and Computation (TEAC) 4 (4), 1-25, 2016
Exact learning of discretized geometric concepts
NH Bshouty, PW Goldberg, SA Goldman, HD Mathias
SIAM journal on Computing 28 (2), 674-699, 1998
Consensus halving is PPA-complete
A Filos-Ratsikas, PW Goldberg
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing …, 2018
The system can't perform the operation now. Try again later.
Articles 1–20