The game world is flat: The complexity of nash equilibria in succinct games

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4051 LNCS, Issue , 2006, Pages 513-524

  Daskalakis, Constantinos ^a   Fabrikant, Alex ^a   Papadimitriou, Christos H ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; PROBLEM SOLVING; TELECOMMUNICATION NETWORKS; THEOREM PROVING;

NASH EQUILIBRIA; NASH EQUILIBRIUM PROBLEM; PPAD-COMPLETE PROBLEM; SUCCINCT GAMES;

GAME THEORY;

EID: 33746380892     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11786986_45     Document Type: Conference Paper

References (20)

1. R. J. Aumann. "Subjectivity and Correlation in Randomized Strategies," Journal of Mathematical Economics, 1, pp. 67-95, 1974.
2. P. Bürgisser. "On the structure of Valiant's complexity classes," Discr. Math. Theoret. Comp. Sci., 3, pp. 73-94, 1999.
3. X. Chen and X. Deng. "3-NASH is PPAD-Complete," ECCC, TR05-134, 2005.
4. X. Chen and X. Deng. "Settling the Complexity of 2-Player Nash-Equilibrium," ECCC, TR05-140, 2005.
5. C. Daskalakis and C. H. Papadimitriou. "Three-Player Games Are Hard," ECCC, TR05-139, 2005.
6. C. Daskalakis, P. W. Goldberg and C. H. Papadimitriou. "The Complexity of Computing a Nash Equilibrium," Proceedings of 38th STOC, 2006.
7. A. Fabrikant, C.H. Papadimitriou and K. Talwar. "The Complexity of Pure Nash Equilibria," Proceedings of 36th STOC, 2004.
8. J. Feigenbaum, D. Koller and P. Shor. "A game-theoretic classification of interactive complexity classes," IEEE Conference on Structure in Complexity Theory, 1995.
9. L. Fortnow, R. Impagliazzo, V. Kabanets and C. Umans. "On the Complexity of Succinct Zero-Sum Games," IEEE Conference on Computational Complexity, 2005.
10. J. Geanakoplos. "Nash and Walras Equilibrium via Brouwer," Economic Theory, 21, 2003.
11. P. W. Goldberg and C. H. Papadimitriou. "Reducibility Among Equilibrium Problems," Proceedings of 38th STOC, 2006.
12. D. S. Johnson, C. H. Papadimitriou and M. Yannakakis, "How Easy is Local Search?," J. Comput. Syst. Sci. 37, 1, pp. 79-100, 1988.
13. M. Kearns, M. Littman and S. Singh. "Graphical Models for Game Theory," In UAI, 2001.
14. C. E. Lemke and J. T. Howson Jr.. "Equilibrium points of bimatrix games," Journal of the Society for Industrial and Applied Mathematics, 12, 413-423, 1964.
15. J. Nash. "Noncooperative Games," Annals of Mathematics, 54, 289-295, 1951.
16. M.J. Osborne and A. Rubinstein. A Course in Game Theory, MIT Press, 1994.
17. C. H. Papadimitriou. "Computing Correlated Equilibria in Multiplayer Games," STOC, 2005.
18. 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.
19. R. Savani and B. von Stengel. "Exponentially many steps for finding a Nash equilibrium in a Bimatrix Game". Proceedings of 45th FOCS, 2004.
20. B. von Stengel, Computing equilibria for two-person games. In R.J. Aumann and S. Hart, editors, Handbook of Game Theory, Vol. 3, pp. 1723-1759. North-Holland, Amsterdam, 2002.