New results on the complexity of uniformly mixed Nash equilibria

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

Volumn 3828 LNCS, Issue , 2005, Pages 1023-1032

  Bonifaci, Vincenzo ^a,b   Di Iorio, Ugo ^a   Laura, Luigi ^a  

^a SAPIENZA UNIVERSITY OF ROME   (Italy)

^b EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

Computational complexity; Game theory; Graph theory

Indexed keywords

GAME THEORY; GRAPH THEORY; INFORMATION ANALYSIS; PROBABILITY DISTRIBUTIONS; PROBLEM SOLVING; SET THEORY;

BIMATRIX GAMES; NASH EQUILIBRIA; THEORETICAL PROBLEMS; UNIFORM PROBABILITY DISTRIBUTION;

COMPUTATIONAL COMPLEXITY;

EID: 33744938159     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11600930_103     Document Type: Conference Paper

References (14)

1. V. Bonifaci, U. D. Iorio, and L. Laura. On the complexity of uniformly mixed Nash equilibria and related regular subgraph problems. In Proc. 15th Symp. on Fundamentals of Computation Theory, 2005.
2. B. Codenotti and D. Stefankovic. On the computational complexity of Nash equilibria for (0, 1) bimatrix games. Inform. Proc. Letters, 94(3):145-150, 2005.
3. V. Conitzer and T. Sandholm. Complexity results about Nash equilibria. In Proc. 18th Int. Joint Conf. on Artificial Intelligence, pages 765-771, 2003.
4. A. Fabrikant, C. H. Papadimitriou, and K. Talwar. The complexity of pure Nash equilibria. In Proc. 36th Symp. on Theory of Computing, pages 604-612, 2004.
5. M. Garey and D. Johnson. Computers and intractability. A guide to the theory of NP-completeness. Freeman, 1978.
6. I. Gilboa and E. Zemel. Nash and correlated equilibria: some complexity considerations. Games and Economic Behavior, 1(1):80-93, 1989.
7. R. M. Karp, E. Koutsoupias, C. H. Papadimitriou, and S. Shenker. Optimization problems in congestion control. In Proc. 41st Symp. on Foundations of Computer Science, pages 66-74, 2000.
8. A. McLennan and R. Tourky. Simple complexity from imitation games. Available at http://www.econ.umn.edu/~mclennan/Papers/papers.html, 2005.
9. J. F. Nash. Equilibrium points in n-person games. In Proc. of the National Academy of Sciences, volume 36, pages 48-49, 1950.
10. N. Nisan and A. Ronen. Algorithmic mechanism design. In Proc. 31st Symp. on Theory of Computing, pages 129-140, 1999.
11. C. H. Papadimitriou. On the complexity of the parity argument and other inefficient proofs of existence. Journal of Computer and Systems Sciences, 48(3) :498-532, 1994.
12. C. H. Papadimitriou. Algorithms, games and the Internet. In Proc. 33rd Symp. on Theory of Computing, pages 749-753, 2001.
13. T. Roughgarden and Eva Tardos. How bad is selfish routing? Journal of the ACM, 49(2):236-259, 2002.
14. R. Savani and B. von Stengel. Exponentially many steps for finding a Nash equilibrium in a bimatrix game. In Proc. 45th Symp. on Foundations of Computer Science, pages 258-267, 2004.