Journal of Computer and System Sciences - 26th IEEE Conference on Foundations of Computer Science, October 21-23, 1985
On total functions, existence theorems and computational complexity
Theoretical Computer Science
An interior point potential reduction algorithm for the linear complementarity problem
Mathematical Programming: Series A and B
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
Algorithmic Aspects of the Core of Combinatorial Optimization Games
Mathematics of Operations Research
Algorithms, games, and the internet
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Playing large games using simple strategies
Proceedings of the 4th ACM conference on Electronic commerce
On the complexity of price equilibria
Journal of Computer and System Sciences - STOC 2002
Smoothed analysis of algorithms: Why the simplex algorithm usually takes polynomial time
Journal of the ACM (JACM)
Evolutionary Computation
On the Complexity of Two-PlayerWin-Lose Games
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
The complexity of computing a Nash equilibrium
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
The approximation complexity of win-lose games
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
On the complexity of market equilibria with maximum social welfare
Information Processing Letters
Graphical models for game theory
UAI'01 Proceedings of the Seventeenth conference on Uncertainty in artificial intelligence
Polynomial algorithms for approximating nash equilibria of bimatrix games
WINE'06 Proceedings of the Second international conference on Internet and Network Economics
A note on approximate nash equilibria
WINE'06 Proceedings of the Second international conference on Internet and Network Economics
| Hi-index | 0.00 |
The computation of Nash equilibria has been a problem that spanned half a century that has attracted Economists, Operations Researchers, and most recently, Computer Scientists. The study of its complexity, in particular that of the two-player game, has come to a conclusion recently. It is, however, impossible without the subsuming ideas from important progresses made in the various fronts of its investigation. In this article, we present a review of the most relevant ideas, methods, and results in a way that would lead interested readers to get a full picture of the subject. We will also discuss some new issues opened up by the characterization of complexity for the two-player Nash equilibrium problem.