Game theory: Nash equilibrium computation; congestion games, and rate of convergence
to Nash equilibrium. Social choice theory. Auctions: truthful mechanisms
I’m interested in hearing from prospective DPhil/PhD students
interested in computation of game-theoretic solutions, with regard
to computational complexity, communication complexity of query
complexity. Also in topics at the intersection of game theory and
computational learning, including the calibration of agent-based models
with real-world data.
Special issue of Mathematical Logic Quarterly on “Logic and Complexity within Computational Social Choice”
Michaelmas term, foundations of CS (details to be added)
Since July 13 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, which I joined in August 06.
I was founding head of the ECCO research group.
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,
USA. PhD (Edinburgh, ’92); BA (Oxford, ’88)