Paul Goldberg
Professor of Computer Science
Works on algorithmic game theory and machine learning, including the complexity of computing economic equilibria and game-theoretic models of data.
Paul Goldberg's lab at Oxford works on learning theory & optimization and reasoning & neuro-symbolic AI. 15 papers since 2023, 4 at top venues, mostly IJCAI and AAMAS. 3 PhD students. 3 alumni. Applications close .
At a glance
- papers, 2023–2026
- 4/ year
- at T1 venues
- 27%
- PhD students
- 3
- MS students
- 0
- alumni listed
- 3
Papers by yearfrom the lab homepage, 2023–2026
- 3 papers2026 · T1 1 · collecting
- 2 papers2025 · T1 0
- 4 papers2024 · T1 1
- 6 papers2023 · T1 2
T1 venuesOtherVenues: IJCAI, AAMAS, ITCS, Journal of the ACM
Research focuspaper titles that use each topic's words
- complexity6 papers
- Learning theory & optimization0 papers
- Reasoning & neuro-symbolic AI0 papers
- economic0 papers
- game-theoretic0 papers
Paper list
From the lab homepage.
20263 papers
- AAMAS (T1)Complexity of (Non-)Convergence in Iterative Voting (opens in a new tab)
- ITCSComputing Equilibrium Points of Electrostatic Potentials (opens in a new tab)
- ACM Conference on Economics and Computation (EC’26)The Computational Intractability of Not Worst Responding
20252 papers
- Theoretical EconomicsCompetitive and revenue-optimal pricing with budgets (opens in a new tab)
- Theoretical Computer ScienceThe frontier of intractability for EFX with two agents (opens in a new tab)
20244 papers
- WINEContinuous-Time Best-Response and Related Dynamics in Tullock Contests with Convex Costs
- IJCAI (T1)Imperfect-Recall Games: Equilibrium Concepts and Their Complexity (opens in a new tab)
- Mathematics of Operations ResearchSolving Strong-Substitutes Product-Mix Auctions (opens in a new tab)
- STOC ’24: Proceedings of the Annual ACM Symposium on Theory of ComputingThe Complexity of Computing KKT Solutions of Quadratic Programs (opens in a new tab)
20236 papers
- procs of ACM-ECBest-Response Dynamics in Lottery Contests (opens in a new tab)
- ITCS ’23: Proceedings of the Innovations in Theoretical Computer Science ConferenceConsensus Division in an Arbitrary Ratio (opens in a new tab)
- Theoretical Computer ScienceLower Bounds for the Query Complexity of Equilibria in Lipschitz Games (opens in a new tab)
- Theoretical Computer SciencePPAD-complete approximate pure Nash equilibria in Lipschitz games (opens in a new tab)
- Journal of the ACM (T1)The Complexity of Gradient Descent: CLS=PPAD∩PLS (opens in a new tab)
- IJCAI (T1)The Computational Complexity of Single-Player Imperfect-Recall Games (opens in a new tab)
Where alumni went3 listed
Apply to Oxford2027-28
DPhil in Computer Science
- Round
- 2027-28 entry (January round)
- Opens
- —
- GRE
- See program page
- English
- See program page
- Fee
- See program page
Not yet confirmed for this intake.
Similar labsnearest by research summary
- USUCSD
Jun-Kun Wang
- Learning theory & optimization
- USUW
Lillian Ratliff
- Learning theory & optimization
- USUW
Maryam Fazel
- Learning theory & optimization
- CNZhejiang
Tianhang Zheng
- Trustworthy & safe ML
- USCMU
Matt Fredrikson
- Trustworthy & safe ML
- CHEPFL
Caglar Gulcehre
- Reinforcement learning
Your notes
Save this lab to keep notes.
Data
Checked against the lab homepage.
- Collected
- Verified
- Papers
- The lab homepage
- Members
- Lab homepage
- Alumni
- Lab homepage
Tiers are venue classifications, not lab rankings.
Oxfordcloses