On the complexity of uniformly mixed nash equilibria and related regular subgraph problems

Lecture Notes in Computer Science

Volumn 3623, Issue , 2005, Pages 197-208

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

^a SAPIENZA UNIVERSITY OF ROME   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

MATRIX ALGEBRA; PROBABILITY; PROBLEM SOLVING;

NASH EQUILIBRIA; NP-COMPLETE PROBLEM; SUBGRAPHS;

GRAPH THEORY;

EID: 26844478769     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11537311_18     Document Type: Conference Paper

References (10)

1. 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.
2. V. Conitzer and T. Sandholm, Complexity results about Nash equilibria. In Proc. 18th Int. Joint Conf. on Artificial Intelligence, pages 765-771, 2003.
3. 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.
4. M. Garey and D. Johnson. Computers and intractability. A guide to the theory of NP-completeness. Freeman, 1978.
5. I. Gilboa and E. Zemel. Nash and correlated equilibria: some complexity considerations. Games and Economic Behavior, 1(1):80-93, 1989.
6. A. McLennan and R. Tourky. Simple complexity from imitation games. Available at http://www.econ.umn.edu/~mclennan/Papers/papers.html, 2005.
7. J. F. Nash. Equilibrium points in n-person games. In Proc. of the National Academy of Sciences, volume 36, pages 48-49, 1950.
8. 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.
9. R. Savani and B. von Stengel. Exponentially many steps for finding a Nash equilibrium in a bimatrix game. In Proc. 45th Symp. Foundations of Computer Science, pages 258-267, 2004.
10. M. Yannakakis. Node- and edge-deletion NP-complete problems. In Proc. 10th Symp. Foundations of Computer Science, pages 253-264, 1978.