Exponential lower bounds for finding Brouwer fixed points
Journal of Complexity
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
The relative complexity of NP search problems
Journal of Computer and System Sciences
Graphical Models for Game Theory
UAI '01 Proceedings of the 17th Conference in Uncertainty in Artificial Intelligence
Exponentially Many Steps for Finding a Nash Equilibrium in a Bimatrix Game
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
Computing correlated equilibria in multi-player games
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Capacity management and equilibrium for proportional QoS
IEEE/ACM Transactions on Networking (TON)
Hi-index | 0.00 |
Nash proved in 1951 that every game has a mixed Nash equilibrium [6]; whether such an equilibrium can be found in polynomial time has been open since that time. We review here certain recent results which shed some light to this old problem. Even though a mixed Nash equilibrium is a continuous object, the problem is essentially combinatorial, since it suffices to identify the support of a mixed strategy for each player; however, no algorithm better than exponential for doing so is known. For the case of two players we have a simplex-like pivoting algorithm due to Lemke and Howson that is guaranteed to converge to a Nash equilibrium; this algorithm has an exponential worst case [9]. But even such algorithms seem unlikely for three or more players: in his original paper Nash supplied an example of a 3-player game, an abstraction of poker, with only irrational Nash equilibria.