{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T19:52:21Z","timestamp":1760298741062,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":31,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,6,16]],"date-time":"2013-06-16T00:00:00Z","timestamp":1371340800000},"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":[[2013,6,16]]},"DOI":"10.1145\/2492002.2482558","type":"proceedings-article","created":{"date-parts":[[2013,6,11]],"date-time":"2013-06-11T16:03:50Z","timestamp":1370966630000},"page":"397-414","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":15,"title":["Learning equilibria of games via payoff queries"],"prefix":"10.1145","author":[{"given":"John","family":"Fearnley","sequence":"first","affiliation":[{"name":"University of Liverpool, Liverpool, United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Gairing","sequence":"additional","affiliation":[{"name":"University of Liverpool, Liverpool, United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paul","family":"Goldberg","sequence":"additional","affiliation":[{"name":"University of Liverpool, Liverpool, United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rahul","family":"Savani","sequence":"additional","affiliation":[{"name":"University of Liverpool, Liverpool, United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2013,6,16]]},"reference":[{"volume-title":"Proc. of ICS. 476--486","author":"Alon N.","key":"e_1_3_2_1_1_1","unstructured":"Alon , N. , Emek , Y. , Feldman , M. , and Tennenholtz , M . 2011. Economical graph discovery . In Proc. of ICS. 476--486 . Alon, N., Emek, Y., Feldman, M., and Tennenholtz, M. 2011. Economical graph discovery. In Proc. of ICS. 476--486."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(87)90052-6"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1137\/060660345"},{"key":"e_1_3_2_1_4_1","unstructured":"Briest P. Goldberg P. W. and R\u00f6glin H. 2008. Approximate equilibria in games with few players. CoRR abs\/0804.4524.  Briest P. Goldberg P. W. and R\u00f6glin H. 2008. Approximate equilibria in games with few players. CoRR abs\/0804.4524."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.geb.2009.05.004"},{"volume-title":"Proc. of SAGT. 114--125","author":"Daskalakis C.","key":"e_1_3_2_1_6_1","unstructured":"Daskalakis , C. , Frongillo , R. , Papadimitriou , C. , Pierrakos , G. , and Valiant , G . 2010. On learning algorithms for Nash equilibria . In Proc. of SAGT. 114--125 . Daskalakis, C., Frongillo, R., Papadimitriou, C., Pierrakos, G., and Valiant, G. 2010. On learning algorithms for Nash equilibria. In Proc. of SAGT. 114--125."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1137\/070699652"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2008.12.031"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1536414.1536427"},{"volume-title":"Proceedings of the 21st IJCAI. 116--121","author":"Duong Q.","key":"e_1_3_2_1_10_1","unstructured":"Duong , Q. , Vorobeychik , Y. , Singh , S. , and Wellman , M . 2009. Learning graphical game models . In Proceedings of the 21st IJCAI. 116--121 . Duong, Q., Vorobeychik, Y., Singh, S., and Wellman, M. 2009. Learning graphical game models. In Proceedings of the 21st IJCAI. 116--121."},{"volume-title":"Proc. of ICALP. 502--513","author":"Even-Dar E.","key":"e_1_3_2_1_11_1","unstructured":"Even-Dar , E. , Kesselmann , A. , and Mansour , Y . 2003. Convergence time to Nash equilibria . In Proc. of ICALP. 502--513 . Even-Dar, E., Kesselmann, A., and Mansour, Y. 2003. Convergence time to Nash equilibria. In Proc. of ICALP. 502--513."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007352.1007445"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250910.1250961"},{"volume-title":"Proc. of ICALP. 514--526","author":"Feldmann R.","key":"e_1_3_2_1_14_1","unstructured":"Feldmann , R. , Gairing , M. , L\u00fccking , T. , Monien , B. , and Rode , M . 2003. Nashification and the coordination ratio for a selfish routing game . In Proc. of ICALP. 514--526 . Feldmann, R., Gairing, M., L\u00fccking, T., Monien, B., and Rode, M. 2003. Nashification and the coordination ratio for a selfish routing game. In Proc. of ICALP. 514--526."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1132516.1132608"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"crossref","unstructured":"Fudenberg D. and Levine D. 1998. The Theory of Learning in Games. MIT Press.  Fudenberg D. and Levine D. 1998. The Theory of Learning in Games. MIT Press.","DOI":"10.1016\/S0014-2921(98)00011-7"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2008.07.001"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1011767.1011787"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.5555\/2954155.2954172"},{"key":"e_1_3_2_1_20_1","unstructured":"Goldberg P. W. Savani R. S\u00f8rensen T. B. and Ventre C. 2013. On the approximation performance of fictitious play in finite games. International Journal of Game Theory 1--25.  Goldberg P. W. Savani R. S\u00f8rensen T. B. and Ventre C. 2013. On the approximation performance of fictitious play in finite games. International Journal of Game Theory 1--25."},{"key":"e_1_3_2_1_21_1","first-page":"107","article-title":"}HM10 Hart, S. and Mansour, Y. 2010. How long to equilibrium? The communication complexity of uncoupled equilibrium procedures","volume":"69","author":"Mansour","year":"2010","unstructured":"art and Mansour 2010 }HM10 Hart, S. and Mansour, Y. 2010. How long to equilibrium? The communication complexity of uncoupled equilibrium procedures . Games and Economic Behavior 69 , 107 -- 126 . art and Mansour2010}HM10 Hart, S. and Mansour, Y. 2010. How long to equilibrium? The communication complexity of uncoupled equilibrium procedures. Games and Economic Behavior 69, 107--126.","journal-title":"Games and Economic Behavior"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1257\/000282803322655581"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.geb.2005.09.007"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-79309-0_24"},{"volume-title":"Proc. of 9th AAMAS. 1131--1138","author":"Jordan P.","key":"e_1_3_2_1_25_1","unstructured":"Jordan , P. , Schvartzman , L. , and Wellman , M . 2010. Strategy exploration in empirical games . In Proc. of 9th AAMAS. 1131--1138 . Jordan, P., Schvartzman, L., and Wellman, M. 2010. Strategy exploration in empirical games. In Proc. of 9th AAMAS. 1131--1138."},{"key":"e_1_3_2_1_26_1","volume-title":"Proc. of 7th AAMAS","volume":"2","author":"Jordan P.","unstructured":"Jordan , P. , Vorobeychik , Y. , and Wellman , M . 2008. Searching for approximate equilibria in empirical games . In Proc. of 7th AAMAS , Vol. 2 . 1063--1070. Jordan, P., Vorobeychik, Y., and Wellman, M. 2008. Searching for approximate equilibria in empirical games. In Proc. of 7th AAMAS, Vol. 2. 1063--1070."},{"volume-title":"Proc.\\ of the 17th UAI. 253--260","author":"Kearns M.","key":"e_1_3_2_1_27_1","unstructured":"Kearns , M. , Littman , M. , and Singh , S . 2001. Graphical models for game theory . In Proc.\\ of the 17th UAI. 253--260 . Kearns, M., Littman, M., and Singh, S. 2001. Graphical models for game theory. In Proc.\\ of the 17th UAI. 253--260."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.5555\/1018410.1018840"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/1082473.1082628"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-007-0715-8"},{"key":"e_1_3_2_1_31_1","volume-title":"Proc. of AAAI. 1552--1555","author":"Wellman M.","year":"2006","unstructured":"Wellman , M. 2006 . Methods for empirical game-theoretic analysis . In Proc. of AAAI. 1552--1555 . Wellman, M. 2006. Methods for empirical game-theoretic analysis. In Proc. of AAAI. 1552--1555."}],"event":{"name":"EC '13: ACM Conference on Electronic Commerce","sponsor":["SIGecom Special Interest Group on Economics and Computation"],"location":"Philadelphia Pennsylvania USA","acronym":"EC '13"},"container-title":["Proceedings of the fourteenth ACM conference on Electronic commerce"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2492002.2482558","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2492002.2482558","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:39:11Z","timestamp":1750235951000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2492002.2482558"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,6,16]]},"references-count":31,"alternative-id":["10.1145\/2492002.2482558","10.1145\/2492002"],"URL":"https:\/\/doi.org\/10.1145\/2492002.2482558","relation":{},"subject":[],"published":{"date-parts":[[2013,6,16]]},"assertion":[{"value":"2013-06-16","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}