{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T19:55:41Z","timestamp":1760298941506,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":27,"publisher":"ACM","license":[{"start":{"date-parts":[[2014,6,1]],"date-time":"2014-06-01T00:00:00Z","timestamp":1401580800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000144","name":"Division of Computer and Network Systems","doi-asserted-by":"publisher","award":["CNS-0846025 and CCF-1101470"],"award-info":[{"award-number":["CNS-0846025 and CCF-1101470"]}],"id":[{"id":"10.13039\/100000144","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000143","name":"Division of Computing and Communication Foundations","doi-asserted-by":"publisher","award":["CNS-0846025 and CCF-1101470"],"award-info":[{"award-number":["CNS-0846025 and CCF-1101470"]}],"id":[{"id":"10.13039\/100000143","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2014,6]]},"DOI":"10.1145\/2600057.2602873","type":"proceedings-article","created":{"date-parts":[[2014,5,30]],"date-time":"2014-05-30T18:18:31Z","timestamp":1401473911000},"page":"753-770","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":15,"title":["Simple approximate equilibria in large games"],"prefix":"10.1145","author":[{"given":"Yakov","family":"Babichenko","sequence":"first","affiliation":[{"name":"California Institute of Technology, Pasadena, CA, USA"}]},{"given":"Siddharth","family":"Barman","sequence":"additional","affiliation":[{"name":"California Institute of Technology, Pasadena, CA, USA"}]},{"given":"Ron","family":"Peretz","sequence":"additional","affiliation":[{"name":"London School of Economics, London, United Kingdom"}]}],"member":"320","published-online":{"date-parts":[[2014,6]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/0024-3795(94)90357-3"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-4068(74)90037-8"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.1120.0557"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"crossref","unstructured":"Yakov Babichenko. 2014. Query complexity of approximate Nash equilibria. To appear in the ACM Symposium on Theory of Computing (STOC) 2014. arXiv preprint arXiv:1306.6686 (2014).  Yakov Babichenko. 2014. Query complexity of approximate Nash equilibria. To appear in the ACM Symposium on Theory of Computing (STOC) 2014. arXiv preprint arXiv:1306.6686 (2014).","DOI":"10.1145\/2591796.2591829"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1516512.1516516"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2483699.2483703"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2008.84"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1536414.1536427"},{"volume-title":"Algorithms and Computation","author":"Farach-Colton Mart\u00edn","key":"e_1_3_2_1_9_1"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"crossref","unstructured":"Fran\u00e7oise Forges. 1990. Correlated equilibrium in two-person zero-sum games. Econometrica 58 2 (1990).  Fran\u00e7oise Forges. 1990. Correlated equilibrium in two-person zero-sum games. Econometrica 58 2 (1990).","DOI":"10.2307\/2938215"},{"key":"e_1_3_2_1_11_1","unstructured":"Michael R Gary and David S Johnson. 1979. Computers and Intractability: A Guide to the Theory of NP-completeness. (1979).   Michael R Gary and David S Johnson. 1979. Computers and Intractability: A Guide to the Theory of NP-completeness. (1979)."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00199-006-0127-1"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"crossref","unstructured":"Paul Goldberg and Aaron Roth. 2013. Bounds for the query complexity of approximate equilibria. In Electronic Colloquium on Computational Complexity (ECCC) TR13 (136).  Paul Goldberg and Aaron Roth. 2013. Bounds for the query complexity of approximate equilibria. In Electronic Colloquium on Computational Complexity (ECCC) TR13 (136).","DOI":"10.1145\/2600057.2602845"},{"key":"e_1_3_2_1_14_1","unstructured":"James Hannan. 1957. Approximation to Bayes risk in repeated play. Contributions to the Theory of Games 3 (1957) 97--139.  James Hannan. 1957. Approximation to Bayes risk in repeated play. Contributions to the Theory of Games 3 (1957) 97--139."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1468-0262.2005.00625.x"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1111\/1468-0262.00153"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-79309-0_24"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.1963.10500830"},{"key":"e_1_3_2_1_19_1","unstructured":"Albert Xin Jiang and Kevin Leyton-Brown. 2013. Polynomial-time computation of exact correlated equilibrium in compact games. Games and Economic Behavior (2013).  Albert Xin Jiang and Kevin Leyton-Brown. 2013. Polynomial-time computation of exact correlated equilibrium in compact games. Games and Economic Behavior (2013)."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1468-0262.2004.00549.x"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/195058.195447"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/779928.779933"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.2307\/1969529"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1379759.1379762"},{"key":"e_1_3_2_1_26_1","unstructured":"Ariel Rubinstein. 1998. Modeling bounded rationality. Vol. 1. MIT press. Herbert Alexander Simon. 1982. Models of bounded rationality: Empirically grounded economic reason. Vol. 3. MIT press.  Ariel Rubinstein. 1998. Modeling bounded rationality. Vol. 1. MIT press. Herbert Alexander Simon. 1982. Models of bounded rationality: Empirically grounded economic reason. Vol. 3. MIT press."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jmateco.2007.06.008"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"crossref","unstructured":"H Peyton Young. 2004. Strategic learning and its limits. Oxford University Press.  H Peyton Young. 2004. Strategic learning and its limits. Oxford University Press.","DOI":"10.1093\/acprof:oso\/9780199269181.001.0001"}],"event":{"name":"EC '14: ACM Conference on Economics and Computation","sponsor":["SIGecom Special Interest Group on Economics and Computation"],"location":"Palo Alto California USA","acronym":"EC '14"},"container-title":["Proceedings of the fifteenth ACM conference on Economics and computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2600057.2602873","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2600057.2602873","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T07:01:21Z","timestamp":1750230081000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2600057.2602873"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,6]]},"references-count":27,"alternative-id":["10.1145\/2600057.2602873","10.1145\/2600057"],"URL":"https:\/\/doi.org\/10.1145\/2600057.2602873","relation":{},"subject":[],"published":{"date-parts":[[2014,6]]},"assertion":[{"value":"2014-06-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}