{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T16:37:50Z","timestamp":1787503070812,"version":"build-2736575974"},"publisher-location":"New York, NY, USA","reference-count":22,"publisher":"ACM","license":[{"start":{"date-parts":[[2008,5,17]],"date-time":"2008-05-17T00:00:00Z","timestamp":1210982400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2008,5,17]]},"DOI":"10.1145\/1374376.1374429","type":"proceedings-article","created":{"date-parts":[[2008,5,28]],"date-time":"2008-05-28T12:50:20Z","timestamp":1211979020000},"page":"365-372","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":16,"title":["The myth of the folk theorem"],"prefix":"10.1145","author":[{"given":"Christian","family":"Borgs","sequence":"first","affiliation":[{"name":"Microsoft Research, Redmond, WA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jennifer","family":"Chayes","sequence":"additional","affiliation":[{"name":"Microsoft Research, Redmond, WA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nicole","family":"Immorlica","sequence":"additional","affiliation":[{"name":"Centrum voor Wiskunde en Informatica, Amsterdam, Netherlands"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Adam Tauman","family":"Kalai","sequence":"additional","affiliation":[{"name":"Georgia Institute of Technology, Atlanta, GA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Vahab","family":"Mirrokni","sequence":"additional","affiliation":[{"name":"Microsoft Research, Redmond, WA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Christos","family":"Papadimitriou","sequence":"additional","affiliation":[{"name":"U.C. Berkeley, Berkeley, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2008,5,17]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"agame--theoretic analysis,\" mimeo","author":"Shapley","year":"1976","unstructured":"umann, R. and L. Shapley \"Long-term competition : agame--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.) umann, R. and L. Shapley \"Long-term competition: agame--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.)"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511800481.006"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2006.69"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2006.20"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/1283383.1283401"},{"key":"e_1_3_2_1_6_1","unstructured":"Daskalakis C. personal communication.  Daskalakis C. personal communication."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1132516.1132527"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250910.1250962"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2007.19"},{"key":"e_1_3_2_1_10_1","unstructured":"askalakis C. and C. H. Papadimitriou \"On theexhaustive algorithm for Nash equilibria \" manuscript.  askalakis C. and C. H. Papadimitriou \"On theexhaustive algorithm for Nash equilibria \" manuscript."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"crossref","unstructured":"udenberg D. and E. Maskin\"The Folk Theoremin repeated games with discounting or with incomplete information \" Econometrica 1986.  udenberg D. and E. Maskin\"The Folk Theoremin repeated games with discounting or with incomplete information \" Econometrica 1986.","DOI":"10.2307\/1911307"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"crossref","unstructured":"udenberg D. D. Levine and E. Maskin\"The Folk Theorem with imperfect public information \" Econometrica 1994.  udenberg D. D. Levine and E. Maskin\"The Folk Theorem with imperfect public information \" Econometrica 1994.","DOI":"10.2307\/2951505"},{"key":"e_1_3_2_1_13_1","first-page":"40","article-title":"Regret in the on--line decision problem","volume":"21","author":"Vohra","year":"1997","unstructured":"oster, D. and R. Vohra ( 1997 ) Regret in the on--line decision problem . Games and Economic Behavior , 21 : 40 -- 55 . oster, D. and R. Vohra(1997) Regret in the on--line decision problem. Games and Economic Behavior, 21:40--55.","journal-title":"Games and Economic Behavior"},{"key":"e_1_3_2_1_14_1","volume-title":"Nash and correlated equilibria: Somecomplexity considerations, Games and Economic Behavior1:80--93","author":"Gilboa I.","year":"1989","unstructured":"Gilboa , I. and E. Zemel ( 1989 ) Nash and correlated equilibria: Somecomplexity considerations, Games and Economic Behavior1:80--93 . Gilboa, I. and E. Zemel (1989) Nash and correlated equilibria: Somecomplexity considerations, Games and Economic Behavior1:80--93."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/779928.779933"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.dss.2004.08.007"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.2307\/1969529"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/0165-1765(85)90026-6"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(05)80063-7"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/195058.195445"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0531(86)90021-9"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.2307\/1911925"}],"event":{"name":"STOC '08: Symposium on Theory of Computing","location":"Victoria British Columbia Canada","acronym":"STOC '08","sponsor":["ACM Association for Computing Machinery","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the fortieth annual ACM symposium on Theory of computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1374376.1374429","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1374376.1374429","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T09:57:49Z","timestamp":1750240669000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1374376.1374429"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,5,17]]},"references-count":22,"alternative-id":["10.1145\/1374376.1374429","10.1145\/1374376"],"URL":"https:\/\/doi.org\/10.1145\/1374376.1374429","relation":{},"subject":[],"published":{"date-parts":[[2008,5,17]]},"assertion":[{"value":"2008-05-17","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}