The complexity of computing a Nash equilibrium

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn 2006, Issue , 2006, Pages 71-78

  Daskalakis, Constantinos ^a   Goldberg, Paul W ^b   Papadimitriou, Christos H ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b UNIVERSITY OF WARWICK   (United Kingdom)

Author keywords

Complexity; Game Theory; Nash Equilibrium; PPAD Completeness

Indexed keywords

COMPUTER GRAPHICS; COMPUTER SIMULATION; GAME THEORY; POLYNOMIALS; PROBLEM SOLVING;

BROUWER FUNCTIONS; NASH EQUILIBRIUM; POLYNOMIAL TIME; PPAD-COMPLETENESS;

COMPUTATIONAL COMPLEXITY;

EID: 33748108509     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1132516.1132527     Document Type: Conference Paper

References (27)

1. P. Beame, S. Cook, J. Edmonds, R. Impagliazzo, T. Pitassi. "The Relative Complexity of NP Search Problems," J. Comput. Syst. Sci. 57, 1, pp. 13-19, 1998.
2. X. Chen and X. Deng. "3-NASH is PPAD-Complete," Electronic Colloquium in Computational Complexity TR05-134, 2005.
3. X. Chen and X. Deng. "Settling the Complexity of 2-Player Nash-Equilibrium," Electronic Colloquium in Computational Complexity TR05-140, 2005.
4. X. Chen, X. Deng and S. Teng. "Computing Nash Equilibria: Approximation and Smoothed Complexity," arXiv report, 2006.
5. B. Codenotti, A. Saberi, K. Varadarajan and Y. Ye. "Leontief Economies Encode Nonzero Sum Two-Player Games," Proceedings of SODA, 2006.
6. V. Conitzer and T. Sandholm, "Complexity Results about Nash Equilibria," Proceedings of IJCAI, 2003.
7. C. Daskalakis, A. Fabrikant and C. H. Papadimitriou. "The Game World is Flat: The Complexity of Nash Equilibria in Succinct Games," To appear, 2006.
8. C. Daskalakis and C. H. Papadimitriou. "Three-Player Games Are Hard," Electronic Colloquium in Computational Complexity TR05-139, 2005.
9. A. Fabrikant, C.H. Papadimitriou and K. Talwar. "The Complexity of Pure Nash Equilibria," Proceedings of STOC, 2004.
10. J. Geanakoplos. "Nash and Walras Equilibrium via Brouwer," Economic Theory, 21, 2003.
11. I. Gilboa and E. Zemel. "Nash and correlated equilibria: Some complexity considerations," Games and Economic Behavior, 1989.
12. P. W. Goldberg and C. H. Papadimitriou. "Reducibility Among Equilibrium Problems," Proceedings of STOC, 2006.
13. M. Hirsch, C. H. Papadimitriou and S. Vavasis. "Exponential Lower Bounds for Finding Brouwer Fixpoints," J. Complexity 5, pp. 379-416, 1989.
14. D. S. Johnson, C. H. Papadimitriou and M. Yannakakis, "How Easy is Local Search?," J. Comput. Syst. Sci. 37, 1, pp. 79-100, 1988.
15. M. Kearns, M. Littman and S. Singh. "Graphical Models for Game Theory," Proceedings of UAI, 2001.
16. C. E. Lemke and J. T. Howson, Jr. "Equilibrium points of bimatrix games", SIAM J. Appl. Math. 12, pp. 413-423, 1964.
17. R. Lipton and E. Markakis. "Nash Equilibria via Polynomial Equations," Proceedings of LATIN, 2004.
18. R. Lipton, E. Markakis and A. Mehta. "Playing large games using simple strategies," Proceedings of the ACM Conference on Electronic Commerce, 2003.
19. M. Littman, M. Kearns and S. Singh. "An Efficient Exact Algorithm for Single Connected Graphical Games," Proceedings of NIPS, 2002.
20. J. Nash. "Noncooperative Games," Annals of Mathematics, 54, 289-295, 1951.
21. J. von Neumann and O. Morgenstern. Theory of Games and Economic Behavior, Princeton University Press, 1944.
22. M.J. Osborne and A. Rubinstein. A Course in Game Theory, MIT Press (1994).
23. C. H. Papadimitriou. "On the Complexity of the Parity Argument and Other Inefficient Proofs of Existence," J. Comput. Syst. Sci. 48, 3, pp. 498-532, 1994.
24. C. H. Papadimitriou and T. Roughgarden. "Computing equilibria in multi-player games," Proceedings of SODA, 2005.
25. C. H. Papadimitriou. "Computing Correlated Equilibria in Multiplayer Games," Proceedings of STOC, 2005.
26. R. Savani and B. von Stengel. "Exponentially many steps for finding a Nash equilibrium in a Bimatrix Game," Proceedings of FOCS, 2004.
27. G. Schoenebeck and S. Vadhan. "The Computational Complexity of Nash Equilibria in Concisely Represented Games," To appear in ACM EC, 2006.