Settling the complexity of two-player nash equilibrium

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

Volumn , Issue , 2006, Pages 261-270

  Chen, Xi ^a   Deng, Xiaotie ^b  

^a TSINGHUA UNIVERSITY   (China)

^b CITY UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

GAME THEORY; PROBLEM SOLVING;

NASH EQUILIBRIUM; PPAD-COMPLETE; TWO-PLAYER GAME;

COMPUTATIONAL COMPLEXITY;

EID: 36448948767     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FOCS.2006.69     Document Type: Conference Paper

References (24)

1. L. Brouwer. Über abbildung von mannigfaltigkeiten. Mathematische Annalen, 71:97-115, 1910.
2. X. Chen and X. Deng. 2d-sperner is ppad-complete. In ICALP 2006.
3. X. Chen and X. Deng. On algorithms for discrete and approximate brouwer fixed points. In STOC 2005.
4. X. Chen and X. Deng. 3-nash is ppad-complete. In ECCC, TR05-134, 2005.
5. X. Chen and X. Deng. Settling the complexity of 2-player nash-equilibrium. In ECCC TR05-140, 2005.
6. X. Chen, X. Deng, and S.-H. Teng. Computing nash equilibria: Approximation and smoothed complexity. In FOCS 2006.
7. R. Cottle and G. Dantzig. Complementary pivot theory of mathematical programming. Linear Algebra Appl., 1:103-125, 1968.
8. G. Dantzig. Linear Programming and Extensions. Princeton University Press, 1963.
9. C. Daskalakis, P. Goldberg, and C. Papadimitriou. The complexity of computing a nash equilibrium. In STOC 2006.
10. C. Daskalakis and C. Papadimitriou. Three-player games are hard. ECCC, TR05-139.
11. P. Goldberg and C. Papadimitriou. Reducibility among equilibrium problems. In STOC 2006.
12. M. Hirsch, C. Papadimitriou, and S. Vavasis. Exponential lower bounds for finding brouwer fixed points. Journal of Complexity, 5:379-416, 1989.
13. L.-S. Huang and S.-H. Teng. On the approximation and smoothed complexity of leontief market equilibria. ECCC, TR06-031.
14. M. Kearns, M. Littman, and S. Singh. Graphical models for game theory. In Proceedings of UAI, 2001.
15. L. Khachian. A polynomial algorithm in linear programming. Dokl. Akad. Nauk, SSSR 244:
16. English translation in Soviet Math. Dokl. 20, 1979.
17. C. Lemke and J. J.T. Howson. Equilibrium points in bimatrix games. J. Soc. Indust. Appl. Math., 12, 1964.
18. O. Morgenstern and J. von Neumann. The Theory of Games and Economic Behavior. Princeton University Press, 1947.
19. C. Papadimitriou. Algorithms, games and the internet. In FOCS 2001, pages 749-753.
20. C. Papadimitriou. On inefficient proofs of existence and complexity classes. In Proceedings of the 4th Czechoslovakian Symposium on Combinatorics, 1991.
21. C. Papadimitriou. On the complexity of the parity argument and other inefficient proofs of existence. Journal of Computer and System Sciences, 1994.
22. R. Savani and B. von Stengel. Hard-to-solve bimatrix games. Econometrica, 74:397-429, 2006.
23. J. von Neumann, zur theorie der gesellshaftsspiele. Mathematische Annalen, 100:295-320, 1928.
24. A.-C. Yao. Probabilistic computations: Towards a unified measure of complexity. In FOCS 1977.