On the complexity of two-player win-lose games

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn 2005, Issue , 2005, Pages 113-122

  Abbott, Tim ^a   Kane, Daniel ^a   Valiant, Paul ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

NASH EQUILIBRIA; TWO PLAYER GAME;

COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; MATHEMATICAL MODELS; PROBLEM SOLVING;

GAME THEORY;

EID: 33748599852     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SFCS.2005.59     Document Type: Conference Paper

References (12)

1. V. Conitzer and T. Sandholm. Complexity results about Nash equilibria. IJCAI 2003, pp. 765-771.
2. B. Codenotti and D. Stefankovic. On the computational complexity of Nash equilibria for (0,1)-bimatrix games. Information Processing Letters, 94(3): 145-150, May 2005.
3. I. Gilboa and E. Zemel. Nash and correlated equilibria: Some complexity considerations. Games and Economic Behavior, 1989.
4. D. Koller and N. Megiddo. Finding mixed strategies with small supports in extensive games. International Journal of Game Theory, 1995.
5. C. E. Lemke and J. T. Howson Jr. Equilibrium points of bimatrix games. Journal of SIAM, 12:413-423, 1964.
6. C. H. Papadimitriou. Algorithms, Games, and the Internet. STOC 2001, pp. 749-753.
7. C. H. Papadimitriou. Computing Correlated Equilibria in Multi-Player Games. STOC 2005, pp. 49-56.
8. C. H. Papadimitriou and T. Roughgarden. Computing Equilibria in Multi-Player Games. SODA 2005.
9. R. Savani and B. von Stengel. Exponentially Many Steps for Finding a Nash Equilibrium in a Bimatrix Game. FOCS 2004, pp. 258-267.
10. G. Schoenebeck and S. Vadhan. The Computational Complexity of Nash Equilibria in Concisely Represented Games. ECCC Report TR05-052.
11. B. von Stengel. Computing equilibria for two-person games. Handbook of Game Theory, Vol. 3, eds. R. J. Aumann and S. Hart, pages 1723-1759, 2002.
12. P. Valiant. Manuscript, July 2005.