The Complexity of Computing a Unique Nash Equilibrium
Alexandros Hollender ( Technical University of Munich )
- 14:30 6th November 2026 ( week 4, Michaelmas Term 2026 )Room 051
The celebrated PPAD-hardness results for Nash equilibria have established that, in general, we should not expect to be able to efficiently compute a Nash equilibrium of a game. But what if the game that we want to solve is promised to have a unique Nash equilibrium?
Based on joint work with Abheek Ghosh and Paul W. Goldberg.