{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T07:01:04Z","timestamp":1743058864069,"version":"3.40.3"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030046118"},{"type":"electronic","value":"9783030046125"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-030-04612-5_12","type":"book-chapter","created":{"date-parts":[[2018,11,20]],"date-time":"2018-11-20T15:09:45Z","timestamp":1542726585000},"page":"168-187","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Learning Convex Partitions and Computing Game-Theoretic Equilibria from Best Response Queries"],"prefix":"10.1007","author":[{"given":"Paul W.","family":"Goldberg","sequence":"first","affiliation":[]},{"given":"Francisco J.","family":"Marmolejo-Coss\u00edo","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,11,21]]},"reference":[{"issue":"4","key":"12_CR1","doi-asserted-by":"publisher","first-page":"36:1","DOI":"10.1145\/2908734","volume":"63","author":"Y Babichenko","year":"2016","unstructured":"Babichenko, Y.: Query complexity of approximate Nash equilibria. J. ACM 63(4), 36:1\u201336:24 (2016)","journal-title":"J. ACM"},{"key":"12_CR2","doi-asserted-by":"crossref","unstructured":"Babichenko, Y., Rubinstein, A.: Communication complexity of approximate Nash equilibria. In: Proceedings of the 49th STOC, pp. 878\u2013889. ACM (2017)","DOI":"10.1145\/3055399.3055407"},{"issue":"1","key":"12_CR3","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1287\/moor.2016.0794","volume":"42","author":"Y Babichenko","year":"2017","unstructured":"Babichenko, Y., Barman, S., Peretz, R.: Empirical distribution of equilibrium play and its testing application. Math. Oper. Res. 42(1), 15\u201329 (2017)","journal-title":"Math. Oper. Res."},{"key":"12_CR4","doi-asserted-by":"crossref","unstructured":"Baldwin, E., Klemperer, P.: Understanding preferences: \u201cdemand types\u201d, and the existence of equilibrium with indivisibilities. Technical report, LSE, October 2016","DOI":"10.2139\/ssrn.2643086"},{"key":"12_CR5","unstructured":"Brown, G.W.: Some notes on computation of game solutions. RAND corporation report, p. 78, April 1949"},{"issue":"2","key":"12_CR6","doi-asserted-by":"publisher","first-page":"674","DOI":"10.1137\/S0097539794274246","volume":"28","author":"NH Bshouty","year":"1998","unstructured":"Bshouty, N.H., Goldberg, P.W., Goldman, S.A., Mathias, H.D.: Exact learning of discretized geometric concepts. SIAM J. Comput. 28(2), 674\u2013699 (1998)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"12_CR7","doi-asserted-by":"publisher","first-page":"14:1","DOI":"10.1145\/1516512.1516516","volume":"56","author":"X Chen","year":"2009","unstructured":"Chen, X., Deng, X., Teng, S.-H.: Settling the complexity of computing two-player Nash equilibria. J. ACM 56(3), 14:1\u201314:57 (2009)","journal-title":"J. ACM"},{"key":"12_CR8","doi-asserted-by":"crossref","unstructured":"Daskalakis, C., Pan, Q.: A counter-example to Karlin\u2019s strong conjecture for fictitious play. In: Proceedings of 55th FOCS, pp. 11\u201320 (2014)","DOI":"10.1109\/FOCS.2014.10"},{"issue":"1","key":"12_CR9","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1137\/070699652","volume":"39","author":"C Daskalakis","year":"2009","unstructured":"Daskalakis, C., Goldberg, P.W., Papadimitriou, C.H.: The complexity of computing a Nash equilibrium. SIAM J. Comput. 39(1), 195\u2013259 (2009)","journal-title":"SIAM J. Comput."},{"key":"12_CR10","first-page":"1305","volume":"16","author":"J Fearnley","year":"2015","unstructured":"Fearnley, J., Gairing, M., Goldberg, P.W., Savani, R.: Learning equilibria of games via payoff queries. J. Mach. Learn. Res. 16, 1305\u20131344 (2015)","journal-title":"J. Mach. Learn. Res."},{"key":"12_CR11","volume-title":"The Theory of Learning in Games","author":"D Fudenberg","year":"1998","unstructured":"Fudenberg, D., Levine, D.K.: The Theory of Learning in Games. MIT Press, Cambridge (1998)"},{"key":"12_CR12","unstructured":"Goldberg, P.W., Kwek, S.: The precision of query points as a resource for learning convex polytopes with membership queries. In: Proceedings of the 13th COLT, pp. 225\u2013235 (2000)"},{"issue":"4","key":"12_CR13","doi-asserted-by":"publisher","first-page":"24:1","DOI":"10.1145\/2956582","volume":"4","author":"PW Goldberg","year":"2016","unstructured":"Goldberg, P.W., Roth, A.: Bounds for the query complexity of approximate equilibria. ACM Trans. Econ. Comput. 4(4), 24:1\u201324:25 (2016)","journal-title":"ACM Trans. Econ. Comput."},{"issue":"4","key":"12_CR14","doi-asserted-by":"publisher","first-page":"1059","DOI":"10.1007\/s00182-012-0362-6","volume":"42","author":"PW Goldberg","year":"2013","unstructured":"Goldberg, P.W., Savani, R., S\u00f8rensen, T.B., Ventre, C.: On the approximation performance of fictitious play in finite games. Int. J. Game Theory 42(4), 1059\u20131083 (2013)","journal-title":"Int. J. Game Theory"},{"key":"12_CR15","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1016\/j.jcss.2017.07.002","volume":"90","author":"PW Goldberg","year":"2017","unstructured":"Goldberg, P.W., Turchetta, S.: Query complexity of approximate equilibria in anonymous games. J. Comput. Syst. Sci. 90, 80\u201398 (2017)","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"12_CR16","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/j.geb.2007.12.002","volume":"69","author":"S Hart","year":"2010","unstructured":"Hart, S., Mansour, Y.: How long to equilibrium? The communication complexity of uncoupled equilibrium procedures. Games Econ. Behav. 69(1), 107\u2013126 (2010)","journal-title":"Games Econ. Behav."},{"key":"12_CR17","unstructured":"Hart, S., Nisan, N.: The query complexity of correlated equilibria. Games and Economic Behavior (2016). ISSN 0899\u20138256"},{"issue":"3","key":"12_CR18","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1215\/S0012-7094-41-00838-4","volume":"8","author":"S Kakutani","year":"1941","unstructured":"Kakutani, S.: A generalization of Brouwer\u2019s fixed point theorem. Duke Math. J. 8(3), 457\u2013459 (1941)","journal-title":"Duke Math. J."},{"issue":"2\/3","key":"12_CR19","doi-asserted-by":"publisher","first-page":"526","DOI":"10.1111\/j.1542-4774.2010.tb00523.x","volume":"8","author":"P Klemperer","year":"2010","unstructured":"Klemperer, P.: The product-mix auction: a new auction design for differentiated goods. J. Eur. Econ. Assoc. 8(2\/3), 526\u2013536 (2010)","journal-title":"J. Eur. Econ. Assoc."},{"key":"12_CR20","doi-asserted-by":"crossref","unstructured":"Lipton, R.J., Markakis, E., Mehta, A.: Playing large games using simple strategies. In: Proceedings of the 4th ACM-EC, EC 2003, pp. 36\u201341. ACM, New York (2003)","DOI":"10.1145\/779928.779933"},{"issue":"2","key":"12_CR21","doi-asserted-by":"publisher","first-page":"286","DOI":"10.2307\/1969529","volume":"54","author":"J Nash","year":"1951","unstructured":"Nash, J.: Non-cooperative games. Ann. Math. 54(2), 286\u2013295 (1951)","journal-title":"Ann. Math."},{"issue":"2","key":"12_CR22","doi-asserted-by":"publisher","first-page":"296","DOI":"10.2307\/1969530","volume":"54","author":"J Robinson","year":"1951","unstructured":"Robinson, J.: An iterative method of solving a game. Ann. Math. 54(2), 296\u2013301 (1951)","journal-title":"Ann. Math."},{"key":"12_CR23","unstructured":"Von Stengel, B.: Leadership with commitment to mixed strategies. CDAM Research report (2004)"}],"container-title":["Lecture Notes in Computer Science","Web and Internet Economics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-04612-5_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T15:34:39Z","timestamp":1709825679000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-04612-5_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030046118","9783030046125"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-04612-5_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"21 November 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WINE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Web and Internet Economics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Oxford","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 December 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 December 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wine2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.cs.ox.ac.uk\/conferences\/wine2018\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easy Chiar","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"119","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"28","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"8","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"24% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"10","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}