{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,23]],"date-time":"2026-03-23T17:26:24Z","timestamp":1774286784493,"version":"3.50.1"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031157134","type":"print"},{"value":"9783031157141","type":"electronic"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":[[2022]]},"DOI":"10.1007\/978-3-031-15714-1_10","type":"book-chapter","created":{"date-parts":[[2022,9,13]],"date-time":"2022-09-13T17:26:44Z","timestamp":1663090004000},"page":"169-186","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["PPAD-Complete Pure Approximate Nash 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","family":"Katzman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,9,14]]},"reference":[{"key":"10_CR1","doi-asserted-by":"crossref","unstructured":"Arora, S., Barak, B.: Computational Complexity - A Modern Approach. Cambridge University Press, Cambridge (2009). http:\/\/www.cambridge.org\/catalogue\/catalogue.asp?isbn=9780521424264","DOI":"10.1017\/CBO9780511804090"},{"issue":"2","key":"10_CR2","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":"10_CR3","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1016\/j.geb.2013.04.007","volume":"81","author":"Y Babichenko","year":"2013","unstructured":"Babichenko, Y.: Best-reply dynamics in large binary-choice anonymous games. Games Econ. Behav. 81, 130\u2013144 (2013). https:\/\/doi.org\/10.1016\/j.geb.2013.04.007","journal-title":"Games Econ. Behav."},{"key":"10_CR4","unstructured":"Babichenko, Y.: Small support equilibria in large games. CoRR abs\/1305.2432 (2013). https:\/\/arxiv.org\/abs\/1305.2432"},{"issue":"9","key":"10_CR5","doi-asserted-by":"publisher","first-page":"1163","DOI":"10.1016\/j.apal.2012.01.015","volume":"163","author":"SR Buss","year":"2012","unstructured":"Buss, S.R., Johnson, A.S.: Propositional proofs and reductions between NP search problems. Ann. Pure Appl. Log. 163(9), 1163\u20131182 (2012)","journal-title":"Ann. Pure Appl. Log."},{"key":"10_CR6","doi-asserted-by":"publisher","unstructured":"Cai, Y., Daskalakis, C.: On minmax theorems for multiplayer games. In: Randall, D. (ed.) Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, SODA, pp. 217\u2013234. SIAM (2011). https:\/\/doi.org\/10.1137\/1.9781611973082.20","DOI":"10.1137\/1.9781611973082.20"},{"issue":"3","key":"10_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.: Settling the complexity of computing two-player Nash equilibria. J. ACM 56(3), 14:1-14:57 (2009)","journal-title":"J. ACM"},{"key":"10_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1007\/978-3-662-48995-6_21","volume-title":"Web and Internet Economics","author":"R Cummings","year":"2015","unstructured":"Cummings, R., Kearns, M., Roth, A., Wu, Z.S.: Privacy and truthful equilibrium selection for aggregative games. In: Markakis, E., Sch\u00e4fer, G. (eds.) WINE 2015. LNCS, vol. 9470, pp. 286\u2013299. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48995-6_21"},{"issue":"2","key":"10_CR9","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1145\/1461928.1461951","volume":"52","author":"C Daskalakis","year":"2009","unstructured":"Daskalakis, C., Goldberg, P.W., Papadimitriou, C.H.: The complexity of computing a Nash equilibrium. Commun. ACM 52(2), 89\u201397 (2009). https:\/\/doi.org\/10.1145\/1461928.1461951","journal-title":"Commun. ACM"},{"key":"10_CR10","doi-asserted-by":"publisher","unstructured":"Daskalakis, C., Papadimitriou, C.H.: Continuous local search. In: Randall, D. (ed.) Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, SODA, pp. 790\u2013804. SIAM (2011). https:\/\/doi.org\/10.1137\/1.9781611973082.62","DOI":"10.1137\/1.9781611973082.62"},{"key":"10_CR11","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. Theor. 156, 207\u2013245 (2015)","journal-title":"J. Econ. Theor."},{"key":"10_CR12","doi-asserted-by":"publisher","first-page":"1041","DOI":"10.1016\/j.jet.2015.02.001","volume":"157","author":"J Deb","year":"2015","unstructured":"Deb, J., Kalai, E.: Stability in large Bayesian games with heterogeneous players. J. Econ. Theor. 157, 1041\u20131055 (2015)","journal-title":"J. Econ. Theor."},{"key":"10_CR13","unstructured":"Deligkas, A., Fearnley, J., Savani, R.: Tree Polymatrix Games are PPAD-hard. In: 47th International Colloquium on Automata, Languages, and Programming, ICALP. LIPIcs, vol. 168, pp. 38:1\u201338:14 (2020)"},{"issue":"2","key":"10_CR14","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1007\/s00453-015-0078-7","volume":"77","author":"A Deligkas","year":"2015","unstructured":"Deligkas, A., Fearnley, J., Savani, R., Spirakis, P.: Computing approximate Nash equilibria in polymatrix games. Algorithmica 77(2), 487\u2013514 (2015). https:\/\/doi.org\/10.1007\/s00453-015-0078-7","journal-title":"Algorithmica"},{"key":"10_CR15","doi-asserted-by":"crossref","unstructured":"Filos-Ratsikas, A., Giannakopoulos, Y., Hollender, A., Lazos, P., Po\u00e7as, D.: On the complexity of equilibrium computation in first-price auctions. In: EC 2021: The 22nd ACM Conference on Economics and Computation, pp. 454\u2013476. ACM (2021)","DOI":"10.1145\/3465456.3467627"},{"key":"10_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1007\/978-3-030-85947-3_9","volume-title":"Algorithmic Game Theory","author":"PW Goldberg","year":"2021","unstructured":"Goldberg, P.W., Katzman, M.J.: Lower bounds for the query complexity of equilibria in Lipschitz games. In: Caragiannis, I., Hansen, K.A. (eds.) SAGT 2021. LNCS, vol. 12885, pp. 124\u2013139. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-85947-3_9"},{"key":"10_CR17","doi-asserted-by":"crossref","unstructured":"Goldberg, P.W., Katzman, M.J.: PPAD-complete pure approximate Nash equilibria in Lipschitz games (2022)","DOI":"10.1007\/978-3-031-15714-1_10"},{"issue":"1","key":"10_CR18","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)","journal-title":"Theory Comput. Syst."},{"issue":"4","key":"10_CR19","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. Economics and Comput. 4(4), 24:1-24:25 (2016)","journal-title":"ACM Trans. Economics and Comput."},{"key":"10_CR20","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."},{"key":"10_CR21","doi-asserted-by":"publisher","first-page":"438","DOI":"10.1016\/j.geb.2013.06.007","volume":"86","author":"R Gradwohl","year":"2014","unstructured":"Gradwohl, R., Reingold, O.: Fault tolerance in large games. Games Econ. Behav. 86, 438\u2013457 (2014)","journal-title":"Games Econ. Behav."},{"key":"10_CR22","doi-asserted-by":"publisher","first-page":"381","DOI":"10.15388\/LMJ.1968.20224","volume":"8","author":"E Janovskaja","year":"1968","unstructured":"Janovskaja, E.: Equilibrium points in polymatrix games. Lith. Math. J. 8, 381\u2013384 (1968). https:\/\/doi.org\/10.15388\/LMJ.1968.20224","journal-title":"Lith. Math. J."},{"key":"10_CR23","doi-asserted-by":"crossref","unstructured":"Liu, Z., Li, J., Deng, X.: On the approximation of Nash equilibria in sparse win-lose multi-player games. In: Thirty-Fifth AAAI Conference on Artificial Intelligence, AAAI, pp. 5557\u20135565. AAAI Press (2021)","DOI":"10.1609\/aaai.v35i6.16699"},{"issue":"2","key":"10_CR24","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1016\/0304-3975(91)90200-L","volume":"81","author":"N Megiddo","year":"1991","unstructured":"Megiddo, N., Papadimitriou, C.H.: On total functions, existence theorems and computational complexity. Theor. Comput. Sci. 81(2), 317\u2013324 (1991)","journal-title":"Theor. Comput. Sci."},{"key":"10_CR25","unstructured":"Nash, J.: Non-cooperative games. Ph.D. thesis, Princeton University (1950)"},{"key":"10_CR26","doi-asserted-by":"publisher","first-page":"286","DOI":"10.2307\/1969529","volume":"286\u2013295","author":"J Nash","year":"1951","unstructured":"Nash, J.: Non-cooperative games. Ann. Math. 286\u2013295, 286\u2013295 (1951)","journal-title":"Ann. Math."},{"issue":"3","key":"10_CR27","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1016\/S0022-0000(05)80063-7","volume":"48","author":"CH Papadimitriou","year":"1994","unstructured":"Papadimitriou, C.H.: On the complexity of the parity argument and other inefficient proofs of existence. J. Comput. Syst. Sci. 48(3), 498\u2013532 (1994)","journal-title":"J. Comput. Syst. Sci."},{"key":"10_CR28","doi-asserted-by":"crossref","unstructured":"Papadimitriou, C.H., Peng, B.: Public goods games in directed networks. In: EC 2021: The 22nd ACM Conference on Economics and Computation, pp. 745\u2013762. ACM (2021)","DOI":"10.1145\/3465456.3467616"},{"issue":"3","key":"10_CR29","doi-asserted-by":"publisher","first-page":"917","DOI":"10.1137\/15M1039274","volume":"47","author":"A Rubinstein","year":"2018","unstructured":"Rubinstein, A.: Inapproximability of Nash equilibrium. SIAM J. Comput. 47(3), 917\u2013959 (2018). https:\/\/doi.org\/10.1137\/15M1039274","journal-title":"SIAM J. Comput."},{"issue":"2","key":"10_CR30","doi-asserted-by":"publisher","first-page":"4:1","DOI":"10.1145\/2189778.2189779","volume":"4","author":"G Schoenebeck","year":"2012","unstructured":"Schoenebeck, G., Vadhan, S.P.: The computational complexity of Nash equilibria in concisely represented games. ACM Trans. Comput. Theory 4(2), 4:1-4:50 (2012). https:\/\/doi.org\/10.1145\/2189778.2189779","journal-title":"ACM Trans. Comput. Theory"}],"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-031-15714-1_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,18]],"date-time":"2023-02-18T23:33:41Z","timestamp":1676763221000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-15714-1_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031157134","9783031157141"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-15714-1_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"14 September 2022","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":"Colchester","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":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 September 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 September 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sagt2022","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":"83","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":"34","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":"41% - 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.01","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":"6.9","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)"}}]}}