Paul W. Goldberg professor of Computer Science office phone: 01865-610756 email: Paul.Goldberg “at” cs.ox.ac.uk • Recent talks • Research (overview, papers, research group) • research community activities • Teaching and administration • About me (very short bio) • Some links twitter account LinkedIn account Use the arrow keys or cursor to select from the above topics. • Quick link to papers, including a general discussion of the research topics Recent talks: talk at Robert Wilson symposium, July 2018. General topics: Game theory: Nash equilibrium computation; congestion games, and rate of convergence to Nash equilibrium. Social choice theory. Auctions: truthful mechanisms List of my papers; and on DBLP associate editor of Journal of the ACM and SIAM Journal on Computing steering cttee of annual conference on Web and Internet Economics (WINE), during 2017–2022 organiser of Dagstuhl seminar 17251: Game Theory Meets Computational Learning Theory 2017 EATCS Fellow Cttee 2015–2018 some PCs: SAGT 2021; ICALP 2015; WINE 2012 (chair); 13th ACM-EC; WINE 2011; 11th ACM-EC; 12th ACM-EC; 2008 workshop on Computational Social Choice (co-chair) Special issue of Mathematical Logic Quarterly on “Logic and Complexity within Computational Social Choice” (CFP, 2008) • Computational Complexity course, my page; CS dept page 2021–: Course director of MFoCS degree program 2016–2021: Course director of MSc in Advanced Computer Science (previously MSc in CS, became “advanced” in 2020/1); on supervisory cttee of MFoCS Since 2013 I have been a professor at the Dept of Computer Science, University of Oxford. Previously I was a professor at the Dept of Computer Science, University of Liverpool, where I moved in 2006. I was founding head of the ECCO research group. At both Oxford and Liverpool, I’ve worked extensively on algorithmic game theory and related problems in algorithms and computational complexity. Prior to this I was at the Department of Computer Science, University of Warwick, from 1997. I have also worked at Aston University and Sandia National Labs (working on algorithmic problems from computational biology), USA. PhD (Edinburgh, ’92) in computational learning theory; BA in mathematics (Oxford, ’88). Game Theory Society newsletter Choosing a PhD supervisor (THES) Choosing a PhD supervisor (New Scientist) Nick Palmer PhD thesis; Pattarawit Polpinit PhD thesis; Neelam Gohar PhD thesis; Tony McCabe PhD thesis; Arnoud Pastink MSc thesis Theory matters: theoretical computer science (TCS) advocacy wiki; Appendix A: TCS breakthroughs Computational social choice mailing list MFI’09 Open Problem Garden: wiki for math open problems A View of the World from Broad Street

---

Computational Complexity course, HT 2023 Publications (list maintained by me) Publications on Google scholar; DBLP; ORCID (incomplete); ACM DL; arXiv

---

I’m interested in hearing from prospective research students or other collaborators. topics/key phrases:

• Computational complexity and NP total search problems
• machine learning; game-theoretic models for data
• Agent-based models; calibration with real-world data
• decentralized computation of economic equilibria

Paul Goldberg