{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,23]],"date-time":"2025-06-23T16:05:21Z","timestamp":1750694721334,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":5,"publisher":"ACM","license":[{"start":{"date-parts":[[2015,6,15]],"date-time":"2015-06-15T00:00:00Z","timestamp":1434326400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Google Faculty Research Award"},{"name":"Linde\/SISL Postdoctoral Fellowship"},{"name":"Charles Lee Powell Foundation"},{"name":"Microsoft Research Faculty Fellowship"},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CNS-0846025, CCF-1101470, and CNS-1254169"],"award-info":[{"award-number":["CNS-0846025, CCF-1101470, and CNS-1254169"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2015,6,15]]},"DOI":"10.1145\/2764468.2764497","type":"proceedings-article","created":{"date-parts":[[2015,6,12]],"date-time":"2015-06-12T18:43:54Z","timestamp":1434134634000},"page":"815-816","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":8,"title":["Finding Any Nontrivial Coarse Correlated Equilibrium Is Hard"],"prefix":"10.1145","author":[{"given":"Siddharth","family":"Barman","sequence":"first","affiliation":[{"name":"California Institute of Technology, Pasadena, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Katrina","family":"Ligett","sequence":"additional","affiliation":[{"name":"California Institute of Technology, Pasadena, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2015,6,15]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1516512.1516516"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"crossref","unstructured":"AGTbook Nisan N. Roughgarden T. Tardos E. and Vazirani V. V. 2007. Algorithmic game theory. Cambridge University Press.   AGTbook Nisan N. Roughgarden T. Tardos E. and Vazirani V. V. 2007. Algorithmic game theory. Cambridge University Press.","DOI":"10.1017\/CBO9780511800481"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1379759.1379762"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2746539.2746578"},{"volume-title":"Strategic learning and its limits","author":"Young H. P.","key":"e_1_3_2_1_5_1","doi-asserted-by":"crossref","DOI":"10.1093\/acprof:oso\/9780199269181.001.0001"}],"event":{"name":"EC '15: ACM Conference on Economics and Computation","sponsor":["SIGecom Special Interest Group on Economics and Computation"],"location":"Portland Oregon USA","acronym":"EC '15"},"container-title":["Proceedings of the Sixteenth ACM Conference on Economics and Computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2764468.2764497","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2764468.2764497","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T19:04:20Z","timestamp":1750273460000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2764468.2764497"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,6,15]]},"references-count":5,"alternative-id":["10.1145\/2764468.2764497","10.1145\/2764468"],"URL":"https:\/\/doi.org\/10.1145\/2764468.2764497","relation":{},"subject":[],"published":{"date-parts":[[2015,6,15]]},"assertion":[{"value":"2015-06-15","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}