{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:18:05Z","timestamp":1750306685468,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":25,"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-1065060"],"award-info":[{"award-number":["CNS-1065060"]}],"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":["CCF-1101389"],"award-info":[{"award-number":["CCF-1101389"]}],"id":[{"id":"10.13039\/100000143","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000266","name":"Engineering and Physical Sciences Research Council","doi-asserted-by":"publisher","award":["EP\/K01000X\/1"],"award-info":[{"award-number":["EP\/K01000X\/1"]}],"id":[{"id":"10.13039\/501100000266","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.2602845","type":"proceedings-article","created":{"date-parts":[[2014,5,30]],"date-time":"2014-05-30T18:18:31Z","timestamp":1401473911000},"page":"639-656","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":14,"title":["Bounds for the query complexity of approximate equilibria"],"prefix":"10.1145","author":[{"given":"Paul W.","family":"Goldberg","sequence":"first","affiliation":[{"name":"Oxford University, Oxford, United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aaron","family":"Roth","sequence":"additional","affiliation":[{"name":"University of Pennsylvania, Philadelphia, PA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2014,6]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"crossref","unstructured":"Arora E. Hazan and S. Kale. 2012.s The Multiplicative Weights Update Method: a Meta-Algorithm and Applications. Theory of Computing 8 (May 2012) 121--164.  Arora E. Hazan and S. Kale. 2012.s The Multiplicative Weights Update Method: a Meta-Algorithm and Applications. Theory of Computing 8 (May 2012) 121--164.","DOI":"10.4086\/toc.2012.v008a006"},{"key":"e_1_3_2_1_2_1","unstructured":"Y. Babichenko. 2013. Query Complexity of Approximate Nash Equilibria. ArXiv tech rept. 1306.6686 (2013).  Y. Babichenko. 2013. Query Complexity of Approximate Nash Equilibria. ArXiv tech rept. 1306.6686 (2013)."},{"key":"e_1_3_2_1_3_1","unstructured":"Y. Babichenko and S. Barman. 2013. Query complexity of correlated equilibrium. ArXiv tech rept. 1306.2437 (2013).  Y. Babichenko and S. Barman. 2013. Query complexity of correlated equilibrium. ArXiv tech rept. 1306.2437 (2013)."},{"key":"e_1_3_2_1_4_1","unstructured":"Y. Babichenko S. Barman and R. Peretz. 2013. Small-Support Approximate Correlated Equilibria. ArXiv tech rept. 1308.6025 (2013).  Y. Babichenko S. Barman and R. Peretz. 2013. Small-Support Approximate Correlated Equilibria. ArXiv tech rept. 1308.6025 (2013)."},{"key":"e_1_3_2_1_5_1","article-title":"Preference Elicitation and Query Learning","author":"Blum A.","year":"2004","journal-title":"Journal of Machine Learning Research 5"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"crossref","unstructured":"A. Blum and Y. Mansour. 2007. Learning Regret Minimization and Equilibria. In Algorithmic Game Theory Cambridge University Press (2007).  A. Blum and Y. Mansour. 2007. Learning Regret Minimization and Equilibria. In Algorithmic Game Theory Cambridge University Press (2007).","DOI":"10.1017\/CBO9780511800481.006"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1516512.1516516"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/501158.501191"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1613\/jair.2606"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1137\/070699652"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2492002.2482558"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/2954155.2954165"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"crossref","unstructured":"J. Fearnley and R. Savani. 2013. Finding Approximate Nash Equilibria of Bimatrix Games via Payoff Queries. Arxiv rept. http:\/\/arxiv.org\/abs\/1310.7419 (2013).  J. Fearnley and R. Savani. 2013. Finding Approximate Nash Equilibria of Bimatrix Games via Payoff Queries. Arxiv rept. http:\/\/arxiv.org\/abs\/1310.7419 (2013).","DOI":"10.1145\/2600057.2602847"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"crossref","unstructured":"Y. Freund and R. Schapire. 1999. Adaptive game playing using multiplicative weights. Games and Economic Behavior 29 (Oct. 1999) 79--103.  Y. Freund and R. Schapire. 1999. Adaptive game playing using multiplicative weights. Games and Economic Behavior 29 (Oct. 1999) 79--103.","DOI":"10.1006\/game.1999.0738"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"crossref","unstructured":"P.W. Goldberg and A. Pastink. 2014. On the Communication Complexity of Approximate Nash Equilibria. Games and Economic Behavior 85 (May 2014) 19--31.  P.W. Goldberg and A. Pastink. 2014. On the Communication Complexity of Approximate Nash Equilibria. Games and Economic Behavior 85 (May 2014) 19--31.","DOI":"10.1016\/j.geb.2014.01.009"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-28914-9_19"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2010.85"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.geb.2007.12.002"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1111\/1468-0262.00153"},{"key":"e_1_3_2_1_20_1","unstructured":"S. Hart and N. Nisan. 2013. The Query Complexity of Correlated Equilibria. ArXiv tech rept. 1305.4874 (2013).  S. Hart and N. Nisan. 2013. The Query Complexity of Correlated Equilibria. ArXiv tech rept. 1305.4874 (2013)."},{"volume-title":"Large Games: Incentives and Privacy. Arxiv rept","year":"2013","author":"Kearns M.","key":"e_1_3_2_1_21_1"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-008-9227-6"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1060590.1060598"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806689.1806794"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2008.10129172"}],"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.2602845","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2600057.2602845","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T07:01:20Z","timestamp":1750230080000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2600057.2602845"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,6]]},"references-count":25,"alternative-id":["10.1145\/2600057.2602845","10.1145\/2600057"],"URL":"https:\/\/doi.org\/10.1145\/2600057.2602845","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"}}]}}