{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T17:41:31Z","timestamp":1787506891914,"version":"build-2736575974"},"publisher-location":"New York, NY, USA","reference-count":66,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,6,15]],"date-time":"2021-06-15T00:00:00Z","timestamp":1623715200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000008","name":"David and Lucile Packard Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000008","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001736","name":"German-Israeli Foundation for Scientific Research and Development","doi-asserted-by":"publisher","award":["2027111"],"award-info":[{"award-number":["2027111"]}],"id":[{"id":"10.13039\/501100001736","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001742","name":"United States-Israel Binational Science Foundation","doi-asserted-by":"publisher","award":["2018397"],"award-info":[{"award-number":["2018397"]}],"id":[{"id":"10.13039\/501100001742","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,6,15]]},"DOI":"10.1145\/3406325.3451039","type":"proceedings-article","created":{"date-parts":[[2021,6,15]],"date-time":"2021-06-15T21:26:13Z","timestamp":1623792373000},"page":"1426-1437","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":18,"title":["Settling the complexity of Nash equilibrium in congestion games"],"prefix":"10.1145","author":[{"given":"Yakov","family":"Babichenko","sequence":"first","affiliation":[{"name":"Technion, Israel"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Aviad","family":"Rubinstein","sequence":"additional","affiliation":[{"name":"Stanford University, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2021,6,15]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1455248.1455249"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2008.10129170"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1137\/090748986"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/3055399.3055402"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1137\/070702370"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2908734"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/3055399.3055407"},{"key":"e_1_3_2_1_8_1","volume-title":"FOCS","author":"Babichenko Yakov","year":"2020","unstructured":"Yakov Babichenko and Aviad Rubinstein. 2020. Communication complexity of Nash equilibrium in potential games. In FOCS 2020."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975482.55"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1374376.1374430"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.ITCS.2020.73"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1561\/2200000050"},{"key":"e_1_3_2_1_13_1","first-page":"960","volume-title":"Conference on Learning Theory, COLT 2020, 9-12 July 2020, Virtual Event [Graz, Austria]. Proceedings of Machine Learning Research. 125","author":"Bubeck S\u00e9bastien","year":"2020","unstructured":"S\u00e9bastien Bubeck, Dan Mikulincer, Jacob D. Abernethy, and Shivani Agarwal. 2020. How to Trap a Gradient Flow. In Conference on Learning Theory, COLT 2020, 9-12 July 2020, Virtual Event [Graz, Austria]. Proceedings of Machine Learning Research. 125, PMLR. Pages 940\u2013960. http:\/\/proceedings.mlr.press\/v125\/bubeck20b.html"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.2004.1313795"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.apal.2012.01.015"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1137\/17M1114296"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-019-01406-y"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807406.1807467"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2009.07.052"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1516512.1516516"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/2746539.2746571"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/3357713.3384325"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/3064810"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1219944.1219949"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"crossref","unstructured":"Constantinos Daskalakis. 2008. The Complexity of Nash Equilibria.","DOI":"10.1137\/1.9781611973068.78"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1137\/070699652"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.5555\/2133036.2133098"},{"key":"e_1_3_2_1_28_1","volume-title":"Papadimitriou","author":"Daskalakis Constantinos","year":"2020","unstructured":"Constantinos Daskalakis and Christos H. Papadimitriou. 2020. Continuous Local Search - Corrigendum. http:\/\/people.csail.mit.edu\/costis\/CLS-corrigendum.pdf"},{"key":"e_1_3_2_1_29_1","volume-title":"The Complexity of Constrained Min-Max Optimization. CoRR, abs\/2009.09623","author":"Daskalakis Constantinos","year":"2020","unstructured":"Constantinos Daskalakis, Stratis Skoulakis, and Manolis Zampetakis. 2020. The Complexity of Constrained Min-Max Optimization. CoRR, abs\/2009.09623, 2020. arxiv:2009.09623"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/3188745.3188968"},{"key":"e_1_3_2_1_31_1","volume-title":"Tree Polymatrix Games are PPAD-hard. CoRR, abs\/2002.12119","author":"Deligkas Argyrios","year":"2020","unstructured":"Argyrios Deligkas, John Fearnley, and Rahul Savani. 2020. Tree Polymatrix Games are PPAD-hard. CoRR, abs\/2002.12119, 2020. arxiv:2002.12119"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.ITCS.2020.18"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/3011870"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007352.1007445"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/3406325.3451052"},{"key":"e_1_3_2_1_36_1","volume-title":"CLS: New Problems and Completeness. CoRR, abs\/1702.06017","author":"Fearnley John","year":"2017","unstructured":"John Fearnley, Spencer Gordon, Ruta Mehta, and Rahul Savani. 2017. CLS: New Problems and Completeness. CoRR, abs\/1702.06017, 2017. arxiv:1702.06017"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2020.05.007"},{"key":"e_1_3_2_1_38_1","volume-title":"A faster algorithm for finding Tarski fixed points. CoRR, abs\/2010.02618","author":"Fearnley John","year":"2020","unstructured":"John Fearnley and Rahul Savani. 2020. A faster algorithm for finding Tarski fixed points. CoRR, abs\/2010.02618, 2020. arxiv:2010.02618"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/3188745.3188880"},{"key":"e_1_3_2_1_40_1","volume-title":"On Communication Complexity of Fixed Point Computation. CoRR, abs\/1909.10958","author":"Ganor Anat","year":"2019","unstructured":"Anat Ganor, Karthik C. S., and D\u00f6m\u00f6t\u00f6r P\u00e1lv\u00f6lgyi. 2019. On Communication Complexity of Fixed Point Computation. CoRR, abs\/1909.10958, 2019. arxiv:1909.10958"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973402.98"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.ICALP.2018.60"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.ITCS.2020.1"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.ITCS.2019.38"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2018.00045"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-012-0521-3"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.18.5.312"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(88)90046-3"},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cosrev.2009.04.003"},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1137\/0219052"},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1145\/2591796.2591835"},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1006\/game.1996.0044"},{"key":"e_1_3_2_1_53_1","first-page":"894","volume-title":"Proceedings of the 19th International Conference on Autonomous Agents and Multiagent Systems, AAMAS '20","author":"Murhekar Aniket","year":"2020","unstructured":"Aniket Murhekar, Ruta Mehta, Amal El Fallah Seghrouchni, Gita Sukthankar, Bo An, and Neil Yorke-Smith. 2020. Approximate Nash Equilibria of Imitation Games: Algorithms and Complexity. In Proceedings of the 19th International Conference on Autonomous Agents and Multiagent Systems, AAMAS '20, Auckland, New Zealand, May 9-13, 2020. International Foundation for Autonomous Agents and Multiagent Systems. Pages 887\u2013894. https:\/\/dl.acm.org\/doi\/abs\/10.5555\/3398761.3398865 dl.acm.org\/doi\/abs\/10.5555\/3398761.3398865"},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1145\/1379759.1379762"},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01737559"},{"key":"e_1_3_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1145\/2806883"},{"key":"e_1_3_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2000.892069"},{"key":"e_1_3_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2016.32"},{"key":"e_1_3_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2016.35"},{"key":"e_1_3_2_1_60_1","doi-asserted-by":"publisher","DOI":"10.1137\/15M1039274"},{"key":"e_1_3_2_1_61_1","doi-asserted-by":"publisher","DOI":"10.1137\/0220004"},{"key":"e_1_3_2_1_62_1","doi-asserted-by":"publisher","DOI":"10.1145\/1374376.1374428"},{"key":"e_1_3_2_1_63_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2018.00023"},{"key":"e_1_3_2_1_64_1","doi-asserted-by":"publisher","DOI":"10.1137\/0803004"},{"key":"e_1_3_2_1_65_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2002.1181966"},{"key":"e_1_3_2_1_66_1","volume-title":"Lithuanian Mathematical Journal","author":"Yanovskaya E. B.","year":"1968","unstructured":"E. B. Yanovskaya. 1968. Equilibrium points in polymatrix games. Lithuanian Mathematical Journal, 1968."}],"event":{"name":"STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing","location":"Virtual Italy","acronym":"STOC '21","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3406325.3451039","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3406325.3451039","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T18:01:44Z","timestamp":1750183304000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3406325.3451039"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,15]]},"references-count":66,"alternative-id":["10.1145\/3406325.3451039","10.1145\/3406325"],"URL":"https:\/\/doi.org\/10.1145\/3406325.3451039","relation":{},"subject":[],"published":{"date-parts":[[2021,6,15]]},"assertion":[{"value":"2021-06-15","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}