The myth of the folk theorem

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2008, Pages 365-372

  Borgs, Christian ^a   Kalai, Adam Tauman ^b   Chayes, Jennifer ^a   Mirrokni, Vahab ^a   Immorlica, Nicole ^c   Papadimitriou, Christos ^d  

^a MICROSOFT RESEARCH   (United States)

^b GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

^c CWI   (Netherlands)

^d UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Equilibria; Nash; Repeated games

Indexed keywords

COMPUTATION THEORY; COMPUTER GAMES; POLYNOMIAL APPROXIMATION;

COMPUTATIONALLY EFFICIENT; EQUILIBRIA; FOLK THEOREMS; NASH; NASH EQUILIBRIA; POLYNOMIAL-TIME; REPEATED GAMES;

GAME THEORY;

EID: 57049139490     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1374376.1374429     Document Type: Conference Paper

References (22)

1. Aumann, R. and L. Shapley "Long-term competition: a game-theoretic analysis," mimeo, Hebrew University, 1976. (Reprinted in Megiddo, N. (ed.), 1994. Essays in Game Theory in Honor of Michael Maschler, 1-15, Springer Verlag, Berlin.)
2. Blum, A. and Y. Mansour (2007) Learning, Regret Minimization, and Equilibria. In Algorithmic Game Theory (eds. N. Nisan, T. Roughgarden, E. Tardos, and V. Vazirani), Cambridge University Press.
3. Chen, X., and X. Deng (2006) Settling the Complexity of 2-Player Nash-Equilibrium. In Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS), 261-272.
4. Chen, X., Deng, X., and Teng, S. (2006) Computing Nash Equilibria: Approximation and Smoothed Complexity. In Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS), 603-612.
5. Chen, X., S. Teng and P. Valiant (2007) The approximation complexity of win-lose games, in Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithm.
6. Daskalakis, C. personal communication.
7. Daskalakis, C., P. Goldberg, C. Papadimitriou (2006) The complexity of computing a Nash equilibrium. In Proceedings of the 38th Annual ACM Symposium on Theory of Computing (STOC), 71-78.
8. Daskalakis, C., A. Mehta, and C. H. Papadimitriou "Progress in approximate Nash equilibria," EC 2007.
9. Daskalakis, C. and C. H. Papadimitriou "Computing equilibria in anonymous games," 2007 FOCS.
10. Daskalakis, C. and C. H. Papadimitriou "On the exhaustive algorithm for Nash equilibria," manuscript.
11. Fudenberg, D. and E. Maskin"The Folk Theorem in repeated games with discounting or with incomplete information," Econometrica, 1986.
12. Fudenberg, D., D. Levine and E. Maskin "The Folk Theorem with imperfect public information," Econometrica 1994.
13. Foster, D. and R. Vohra (1997) Regret in the on-line decision problem. Games and Economic Behavior, 21:40-55.
14. Gilboa, L. and E. Zemel (1989) Nash and correlated equilibria: Some complexity considerations, Games and Economic Behavior 1:80-93.
15. Lipton, R., E. Markakis and A. Mehta (2003) Playing large games using simple strategies. In Proceedings of the 4th ACM conference on Electronic commerce (EC), 36-41.
16. Liftman, M., and P. Stone (2005) A polynomial-time Nash equilibrium algorithm for repeated games. Decision Support Systems 39(1): 55-66.
17. Nash, J. (1951) Noncooperative games. Ann Math, 54:286-295.
18. Neyman, A. (1985) Bounded Complexity Justifies Cooperation in the Finitely Repeated Prisoner's Dilemma. Eco- nomic Letters, 19: 227-229.
19. Papadimitriou, C. (1994) On the complexity of the parity argument and other inefficient proofs of existence. Journal of Computer and System Sciences, 498-532.
20. Papadimitriou, C. and M. Yannakakis (1994) On complexity as bounded rationality. In Proceedings of the Twenty- Sixth Annual ACM Symposium on Theory of Computing, 726-733.
21. Rubenstein, A. (1986) Finite automata play the repeated prisoner's dilemma. Journal of Economic Theory, 39:83-96.
22. Smale, S. (1980) The prisoner's dilemma and dynamical systems associated to non-cooperative games. Econometrica, 48:1617-1634.