On the complexity of Nash equilibria of action-graph games

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2009, Pages 710-719

  Daskalakis, Constantinos ^a   Schoenebeck, Grant ^b   Valiant, Gregory ^b   Valiant, Paul ^c  

^a MICROSOFT RESEARCH   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

^c MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; COMPUTATION THEORY; ELECTRONIC TRADING; GAME THEORY; HARDNESS; POLYNOMIAL APPROXIMATION;

ANONYMOUS GAMES; ARBITRARY NUMBER; EFFICIENT COMPUTATION; FULLY POLYNOMIAL TIME APPROXIMATION SCHEMES; HARDNESS RESULT; MULTIPLAYER GAMES; PURE STRATEGY NASH EQUILIBRIUMS; SUCCINCT REPRESENTATION;

TREES (MATHEMATICS);

EID: 70349086937     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611973068.78     Document Type: Conference Paper

References (34)

1. Timothy Abbot, Daniel Kane, and Paul Valiant. On the complexity of two-player win-lose games. In Proceedings of the 46th FOGS, pages 113-122, 2005.
2. Navin A. R. Bhat and Kevin Leyton-Brown. Computing nash equilibria of action-graph games. In UAI, pages 35-42, 2004.
3. Matthias Blonski. Anonymous games with binary actions. Games and Economic Behavior, 28(2):171-180, August 1999.
4. Xi Chen and Xiaotie Deng. Settling the complexity of two-player nash equilibrium. In FOCS, pages 261-272, Washington, DC, USA, 2006. IEEE Computer Society.
5. Xi Chen, Xiaotie Deng, and Shang-Hua Teng. Computing nash equilibria: Approximation and smoothed complexity. In FOCS, pages 603-612, 2006. (Pubitemid 351175548)
6. Xi Chen, Shang-Hua Teng, and Paul Valiant. The approximation complexity of win-lose games. In Proceedings of SODA, 2007.
7. Steve Chien and Alistair Sinclair. Convergence to approximate nash equilibria in congestion games. In SODA, pages 169-178, 2007.
8. Bruno Codenotti and Daniel Štefankovič. On the computational complexity of nash equilibria for (0, 1) bimatrix games. Inf. Process. Lett., 94(3):145-150, 2005.
9. Constantinos Daskalakis, Alex Fabrikant, and Christos H. Papadimitriou. The game world is flat: The complexity of nash equilibria in succinct games. In ICALP (1), pages 513-524, 2006.
10. Constantinos Daskalakis, Paul W. Goldberg, and Christos H. Papadimitriou. The complexity of computing a nash equilibrium. In STOC, 2006.
11. Constantinos Daskalakis and Christos H. Papadimitriou. Computing pure nash equilibria in graphical games via markov random fields. In ACM Conference on Electronic Commerce, pages 91-99, 2006. (Pubitemid 44393628)
12. Constantinos Daskalakis and Christos H. Papadimitriou. Computing equilibria in anonymous games. In FOCS, 2007.
13. Constantinos Daskalakis and Christos H. Papadimitriou. Discretized multinomial distributions and nash equilibria in anonymous games. FOCS, 2008.
14. Constantinos Daskalakis and Christos H. Papadimitriou. Three-player games are hard. Technical Report TR05-139, Electronic Colloquium on Computational Complexity (ECCC), November 2005.
15. Juliane Dunkel and Andreas S. Schulz. On the complexity of pure-strategy nash equilibria in congestion and local-effect games. In WINE, pages 62-73, 2006.
16. F. Fischer F. Brandt and M. Holzer. Equilibria of graphical games with symmetries. Technical Report TR07-136, Electronic Colloquium on Computational Complexity (ECGC), December 2007.
17. Alex Fabrikant, Christos H. Papadimitriou, and Kunal Talwar. The complexity of pure nash equilibria. In STOC, pages 604-612, 2004.
18. D Gale, HW Kuhn, and AW Tucker. On symmetric games. Contributions to the Theory Games, Annals of Mathematics Studies, 24, 1950.
19. Paul W. Goldberg and Christos H. Papadimitriou. Reducibility among equilibrium problems. In STOC, 2006.
20. Albert Xin Jiang and Kevin Leyton-Brown. A polynomial-time algorithm for Action-Graph Games. In AAAI, pages 679-684, 2006.
21. Albert Xin Jiang and Kevin Leyton-Brown. Computing pure nash equilibria in symmetric action graph games. In AAAI, pages 79-85. AAAI Press, 2007.
22. Albert Xin Jiang, Kevin Leyton-Brown, and Navin Bhat. Action-graph games. 2007. Working paper, available at: www.cs.ubc.ca/~jiang/papers/AGG.pdf.
23. Ravi Kannan and Thorsten Theobald. Games of fixed rank: a hierarchy of bimatrix games. In SODA, pages 1124-1132, 2007.
24. Michael Kearns, Michael L. Littman, and Satinder Singh. Graphical models for game theory. In UAI, pages 253-260, 2001.
25. C. E. Lemke and Jr J. T. Howson. Equilibrium points of bimatrix games. SIAM Journal of Applied Mathematics, 12:413-423, 1964.
26. John Nash. Non-cooperative games. Annals of Mathematics, 54(2):286-295, 1951.
27. Christos H. Papadimitriou. On the complexity of the parity argument and other inefficient proofs of existence. J. Comput. Syst. Sci, 48(3):498-532, 1994.
28. Christos H. Papadimitriou and Tim Roughgarden. Computing equilibria in multi-player games. In SODA '05, pages 82-91, 2005.
29. J. Rosenmuller. On a generalization of the lemkehowson algorithm to noncooperative n-person games. SIAM Journal of Applied Mathematics, 21:73-79, 1971.
30. H. E. Scarf. The approximation of fixed points of a continuous mapping SIAM Journal of Applied Mathematics, 15:1328-1343, 1967.
31. Grant Schoenebeck and Salil Vadhan. The computational complexity of nash equilibria in concisely represented games. In EC '06: Proceedings of the 7th ACM conference on Electronic commerce, pages 270-279, New York, NY, USA, 2006. ACM.
32. G. van der Laan and A. J. J. Talman. On the computation of fixed points in the product space of unit simplices and an application to noncooperative ç person games. Mathematics of Operations Research, 7, 1982.
33. J. von Neumann and O. Morgenstern. On the computation of fixed points in the product space of unit simplices and an application to noncooperative n person games. Theory of Games and Economic Behavior, 1944.
34. R. Wilson. Computing equilibria of n-person games. SIAM Journal of Applied Mathematics, 21:80-87, 1971.