{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:32:27Z","timestamp":1759638747833,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030859466"},{"type":"electronic","value":"9783030859473"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-85947-3_9","type":"book-chapter","created":{"date-parts":[[2021,9,14]],"date-time":"2021-09-14T00:45:22Z","timestamp":1631580322000},"page":"124-139","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Lower Bounds for the Query Complexity of Equilibria in Lipschitz Games"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5436-7890","authenticated-orcid":false,"given":"Paul W.","family":"Goldberg","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8147-9110","authenticated-orcid":false,"given":"Matthew J.","family":"Katzman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,9,14]]},"reference":[{"issue":"2","key":"9_CR1","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1287\/moor.1120.0557","volume":"38","author":"Y Azrieli","year":"2013","unstructured":"Azrieli, Y., Shmaya, E.: Lipschitz games. Math. Oper. Res. 38(2), 350\u2013357 (2013). https:\/\/doi.org\/10.1287\/moor.1120.0557","journal-title":"Math. Oper. Res."},{"key":"9_CR2","unstructured":"Babichenko, Y.: Small support equilibria in large games. CoRR abs\/1305.2432 (2013). https:\/\/arxiv.org\/abs\/1305.2432"},{"key":"9_CR3","doi-asserted-by":"publisher","unstructured":"Babichenko, Y.: Query complexity of approximate Nash equilibria. J. ACM 63(4), 1\u201324 (2016). https:\/\/doi.org\/10.1145\/2908734","DOI":"10.1145\/2908734"},{"issue":"1","key":"9_CR4","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1287\/moor.2017.0868","volume":"43","author":"Y Babichenko","year":"2018","unstructured":"Babichenko, Y.: Fast convergence of best-reply dynamics in aggregative games. Math. Oper. Res. 43(1), 333\u2013346 (2018). https:\/\/doi.org\/10.1287\/moor.2017.0868","journal-title":"Math. Oper. Res."},{"issue":"2","key":"9_CR5","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1145\/3381329.3381333","volume":"17","author":"Y Babichenko","year":"2019","unstructured":"Babichenko, Y.: Informational bounds on equilibria (a survey). SIGecom Exch. 17(2), 25\u201345 (2019). https:\/\/doi.org\/10.1145\/3381329.3381333","journal-title":"SIGecom Exch."},{"key":"9_CR6","doi-asserted-by":"publisher","unstructured":"Chen, X., Cheng, Y., Tang, B.: Well-supported vs. approximate Nash equilibria: query complexity of large games. In: Papadimitriou, C.H. (ed.) 8th Innovations in Theoretical Computer Science Conference, ITCS. LIPIcs, vol. 67, pp. 1\u20139 (2017). https:\/\/doi.org\/10.4230\/LIPIcs.ITCS.2017.57","DOI":"10.4230\/LIPIcs.ITCS.2017.57"},{"key":"9_CR7","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/j.jet.2014.02.002","volume":"156","author":"C Daskalakis","year":"2015","unstructured":"Daskalakis, C., Papadimitriou, C.H.: Approximate Nash equilibria in anonymous games. J. Econ. Theory 156, 207\u2013245 (2015). https:\/\/doi.org\/10.1016\/j.jet.2014.02.002","journal-title":"J. Econ. Theory"},{"issue":"10","key":"9_CR8","doi-asserted-by":"publisher","first-page":"2927","DOI":"10.1007\/s00453-020-00709-3","volume":"82","author":"A Deligkas","year":"2020","unstructured":"Deligkas, A., Fearnley, J., Spirakis, P.G.: Lipschitz continuity and approximate equilibria. Algorithmica 82(10), 2927\u20132954 (2020). https:\/\/doi.org\/10.1007\/s00453-020-00709-3","journal-title":"Algorithmica"},{"key":"9_CR9","doi-asserted-by":"crossref","unstructured":"Goldberg, P.W., Katzman, M.J.: Lower bounds for the query complexity of equilibria in Lipschitz games (2021)","DOI":"10.1007\/978-3-030-85947-3_9"},{"issue":"1","key":"9_CR10","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1007\/s00224-018-9851-8","volume":"63","author":"PW Goldberg","year":"2019","unstructured":"Goldberg, P.W., Marmolejo Coss\u00edo, F.J., Wu, Z.S.: Logarithmic query complexity for approximate Nash computation in large games. Theory Comput. Syst. 63(1), 26\u201353 (2019). https:\/\/doi.org\/10.1007\/s00224-018-9851-8","journal-title":"Theory Comput. Syst."},{"key":"9_CR11","doi-asserted-by":"crossref","unstructured":"Goldberg, P.W., Roth, A.: Bounds for the query complexity of approximate equilibria. ACM Trans. Econ. Comput. 4(4), 1\u201325 (2016)","DOI":"10.1145\/2956582"},{"key":"9_CR12","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). https:\/\/doi.org\/10.1016\/j.jcss.2017.07.002","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"9_CR13","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":"9_CR14","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1016\/j.geb.2016.11.003","volume":"108","author":"S Hart","year":"2018","unstructured":"Hart, S., Nisan, N.: The query complexity of correlated equilibria. Games Econ. Behav. 108, 401\u2013410 (2018). https:\/\/doi.org\/10.1016\/j.geb.2016.11.003","journal-title":"Games Econ. Behav."},{"key":"9_CR15","unstructured":"Nash, J.: Non-Cooperative Games. Ph.D. thesis, Princeton University (May 1950)"},{"key":"9_CR16","doi-asserted-by":"crossref","unstructured":"Nash, J.: Non-cooperative games. Annals of mathematics, pp. 286\u2013295 (1951)","DOI":"10.2307\/1969529"},{"key":"9_CR17","doi-asserted-by":"crossref","unstructured":"Peretz, R., Schreiber, A., Schulte-Geers, E.: The Lipschitz constant of perturbed anonymous games. CoRR abs\/2004.14741 (2020). https:\/\/arxiv.org\/abs\/2004.14741","DOI":"10.1007\/s00182-021-00793-x"},{"key":"9_CR18","unstructured":"Phillips, M., Lorenz, T.: \u2018dumb money\u2019 is on gamestop, and it\u2019s beating wall street at its own game (Feb 2021). https:\/\/www.nytimes.com\/2021\/01\/27\/business\/gamestop-wall-street-bets.html. Accessed 5 Feb 2021"},{"key":"9_CR19","doi-asserted-by":"publisher","unstructured":"Rubinstein, A.: Settling the complexity of computing approximate two-player Nash equilibria. In: Dinur, I. (ed.) IEEE 57th Annual Symposium on Foundations of Computer Science, FOCS, pp. 258\u2013265. IEEE Computer Society (2016). https:\/\/doi.org\/10.1109\/FOCS.2016.35","DOI":"10.1109\/FOCS.2016.35"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Game Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-85947-3_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T14:10:15Z","timestamp":1641996615000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-85947-3_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030859466","9783030859473"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-85947-3_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"14 September 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SAGT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Algorithmic Game Theory","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Aarhus","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Denmark","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 September 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 September 2021","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":"sagt2021","order":10,"name":"conference_id","label":"Conference ID","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":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"73","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":"26","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":"0","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":"36% - 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":"7.5","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)"}},{"value":"4 abstracts of presented papers are also included.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}