On the complexity of the parity argument and other inefficient proofs of existence
Journal of Computer and System Sciences - Special issue: 31st IEEE conference on foundations of computer science, Oct. 22–24, 1990
Playing large games using simple strategies
Proceedings of the 4th ACM conference on Electronic commerce
Reducibility among equilibrium problems
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Settling the Complexity of Two-Player Nash Equilibrium
FOCS '06 Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science
Computing Nash Equilibria: Approximation and Smoothed Complexity
FOCS '06 Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science
Progress in approximate nash equilibria
Proceedings of the 8th ACM conference on Electronic commerce
On the Complexity of Nash Equilibria and Other Fixed Points (Extended Abstract)
FOCS '07 Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science
How hard is it to approximate the best Nash equilibrium?
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
On oblivious PTAS's for nash equilibrium
Proceedings of the forty-first annual ACM symposium on Theory of computing
The Complexity of Computing a Nash Equilibrium
SIAM Journal on Computing
New algorithms for approximate Nash equilibria in bimatrix games
WINE'07 Proceedings of the 3rd international conference on Internet and network economics
An optimization approach for approximate Nash equilibria
WINE'07 Proceedings of the 3rd international conference on Internet and network economics
On the complexity of 2d discrete fixed point problem
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
The game world is flat: the complexity of nash equilibria in succinct games
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Hi-index | 0.00 |
We present a direct reduction from k-player games to 2- player games that preserves approximate Nash equilibrium. Previously, the computational equivalence of computing approximate Nash equilibrium in k-player and 2-player games was established via an indirect reduction. This included a sequence of works defining the complexity class PPAD, identifying complete problems for this class, showing that computing approximate Nash equilibrium for k-player games is in PPAD, and reducing a PPAD-complete problem to computing approximate Nash equilibrium for 2-player games. Our direct reduction makes no use of the concept of PPAD, eliminating some of the difficulties involved in following the known indirect reduction.