Symmetries and the complexity of pure Nash equilibrium

Journal of Computer and System Sciences

Volumn 75, Issue 3, 2009, Pages 163-177

  Brandt, Felix ^a   Fischer, Felix ^a   Holzer, Markus ^b  

^a UNIVERSITY OF MUNICH   (Germany)

^b TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

Computational complexity; Game theory; Normal form games; Pure Nash equilibrium; Symmetries

Indexed keywords

COMPUTATIONAL COMPLEXITY;

COMPACT REPRESENTATION; EQUILIBRIUM PROBLEM; MULTIPLAYER GAMES; NORMAL FORM GAMES; PAYOFF FUNCTION; PURE NASH EQUILIBRIUM; SYMMETRIC GAMES; SYMMETRIES;

GAME THEORY;

EID: 58549113971     PISSN: 00220000     EISSN: 10902724     Source Type: Journal    
DOI: 10.1016/j.jcss.2008.09.001     Document Type: Article

References (35)

1. Aumann R.J. Subjectivity and correlation in randomized strategies. J. Math. Econom. 1 (1974) 67-96
2. Beame P., Cook S.A., and Hoover H.J. Log depth circuits for division and related problems. SIAM J. Comput. 15 4 (1986) 994-1003
3. Bhat N., and Leyton-Brown K. Computing Nash equilibria of action-graph games. Proceedings of the 20th Annual Conference on Uncertainty in Artificial Intelligence (UAI) (2004), AUAI Press 35-42
4. Bollobás B. Modern Graph Theory (1998), Springer-Verlag
5. Borel E. La théorie du jeu et les équations intégrales à noyau symétrique. C. R. Acad. Sci. 173 (1921) 1304-1308
6. F. Brandt, F. Fischer, M. Holzer, Equilibria of graphical games with symmetries, Tech. Rep. TR07-136, Electronic Colloquium on Computational Complexity (ECCC), 2007
7. Chandra A.K., Stockmeyer L., and Vishkin U. Constant depth reducibility. SIAM J. Comput. 13 2 (1984) 423-439
8. Chen X., and Deng X. Settling the complexity of 2-player Nash-equilibrium. Proceedings of the 47th Symposium on Foundations of Computer Science (FOCS) (2006), IEEE Press 261-272
9. S.-F. Cheng, D.M. Reeves, Y. Vorobeychik, M.P. Wellman, Notes on equilibria in symmetric games, in: Proceedings of the 6th International Workshop on Game Theoretic and Decision Theoretic Agents (GTDT), 2004
10. Daskalakis C., Goldberg P., and Papadimitriou C. The complexity of computing a Nash equilibrium. Proceedings of the 38th Annual ACM Symposium on the Theory of Computing (STOC) (2006), ACM Press 71-78
11. Daskalakis C., and Papadimitriou C.H. Computing equilibria in anonymous games. Proceedings of the 48th Symposium on Foundations of Computer Science (FOCS) (2007), IEEE Computer Society Press 83-93
12. Daskalakis C., Schoenebeck G., Valiant G., and Valiant P. On the complexity of Nash equilibria of action-graph games. arXiv: 0802.1604v1
13. Fabrikant A., Papadimitriou C.H., and Talwar K. The complexity of pure Nash equilibria. Proceedings of the 36th Annual ACM Symposium on the Theory of Computing (STOC) (2004), ACM Press 604-612
14. Fischer F., Holzer M., and Katzenbeisser S. The influence of neighbourhood and choice on the complexity of finding pure Nash equilibria. Inform. Process. Lett. 99 6 (2006) 239-245
15. Gale D., Kuhn H.W., and Tucker A.W. On symmetric games. In: Kuhn H.W., and Tucker A.W. (Eds). Contributions to the Theory of Games, vol. 1 (1950), Princeton University Press 81-87
16. Garey M.R., and Johnson D.S. Computers and Intractability: A Guide to the Theory of NP-Completeness (1979), W.H. Freeman
17. Gottlob G., Greco G., and Scarcello F. Pure Nash equilibria: Hard and easy games. J. Artificial Intelligence Res. 24 (2005) 195-220
18. Govindan S., and Wilson R. A global Newton method to compute Nash equilibria. J. Econom. Theory 110 1 (2003) 65-86
19. Ieong S., McGrew R., Nudelman E., Shoham Y., and Sun Q. Fast and compact: A simple class of congestion games. Proceedings of the 20th National Conference on Artificial Intelligence (AAAI) (2005), AAAI Press 489-494
20. Jiang A.X., and Leyton-Brown K. Computing pure Nash equilibria in symmetric action-graph games. Proceedings of the 22nd AAAI Conference on Artificial Intelligence (AAAI) (2007), AAAI Press 79-85
21. Johnson D.S. A catalog of complexity classes. In: van Leeuwen J. (Ed). Handbook of Theoretical Computer Science, vol. A (2007), Elsevier 67-161 Ch. 2
22. Johnson D.S., Papadimitriou C.H., and Yannakakis M. How easy is local search?. J. Comput. System Sci. 37 (1988) 79-100
23. K. Leyton-Brown, M. Tennenholtz, Local-effect games, in: Proceedings of the 18th International Joint Conference on Artificial Intelligence (IJCAI), 2003, pp. 772-777
24. Luce R.D., and Raiffa H. Games and Decisions: Introduction and Critical Survey (1957), John Wiley & Sons Inc.
25. Nash J.F. Non-cooperative games. Ann. of Math. 54 2 (1951) 286-295
26. Orlin J.B., Punnen A.P., and Schulz A.S. Approximate local search in combinatorial optimization. SIAM J. Comput. 33 5 (2004) 1201-1214
27. Papadimitriou C.H. Computational Complexity (1994), Addison-Wesley
28. Papadimitriou C.H., and Roughgarden T. Computing equilibria in multi-player games. Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) (2005), SIAM 82-91
29. Parikh R. On context-free languages. J. ACM 13 4 (1966) 570-581
30. Rosenthal R.W. A class of games possessing pure-strategy Nash equilibria. Internat. J. Game Theory 2 (1973) 65-67
31. Ruzzo W. On uniform circuit complexity. J. Comput. System Sci. 22 3 (1981) 365-383
32. Schäffer A.A., and Yannakakis M. Simple local search problems that are hard to solve. SIAM J. Comput. 20 1 (1991) 56-87
33. Schoenebeck G., and Vadhan S. The computational complexity of Nash equilibria in concisely represented games. Proceedings of the 7th ACM Conference on Electronic Commerce (ACM-EC) (2006), ACM Press 270-279
34. von Neumann J. Zur Theorie der Gesellschaftspiele. Math. Ann. 100 (1928) 295-320
35. von Neumann J., and Morgenstern O. The Theory of Games and Economic Behavior. second ed. (1947), Princeton University Press