{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T15:39:02Z","timestamp":1774366742433,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":26,"publisher":"ACM","license":[{"start":{"date-parts":[[2008,7,8]],"date-time":"2008-07-08T00:00:00Z","timestamp":1215475200000},"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":[[2008,7,8]]},"DOI":"10.1145\/1386790.1386832","type":"proceedings-article","created":{"date-parts":[[2008,12,17]],"date-time":"2008-12-17T14:47:02Z","timestamp":1229525222000},"page":"264-273","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":75,"title":["Fast convergence to nearly optimal solutions in potential games"],"prefix":"10.1145","author":[{"given":"Baruch","family":"Awerbuch","sequence":"first","affiliation":[{"name":"Johns Hopkins University, Baltimore, MD, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yossi","family":"Azar","sequence":"additional","affiliation":[{"name":"Tel-Aviv University, Tel-Aviv, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Amir","family":"Epstein","sequence":"additional","affiliation":[{"name":"Tel-Aviv University, Tel-Aviv, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vahab Seyed","family":"Mirrokni","sequence":"additional","affiliation":[{"name":"Mi rosoft Research, Redmond, WA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander","family":"Skopalik","sequence":"additional","affiliation":[{"name":"RWTH Aachen, Aachen, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2008,7,8]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2006.55"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2004.68"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1060590.1060599"},{"key":"e_1_3_2_1_4_1","volume-title":"Best response dynamics in multicast cost sharing","author":"Charikar M.","year":"2007","unstructured":"M. Charikar , C. Mattieu , H. Karloff , S. Naor , and M. Saks . Best response dynamics in multicast cost sharing . 2007 . Unpublished Manuscript . M. Charikar, C. Mattieu, H. Karloff, S. Naor, and M. Saks. Best response dynamics in multicast cost sharing. 2007. Unpublished Manuscript."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1134707.1134716"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2006.69"},{"key":"e_1_3_2_1_7_1","volume-title":"Proc. 18th ACM-SIAM Symp. on Discrete Algorithms (SODA)","author":"Chien Steve","year":"2007","unstructured":"Steve Chien and Alistair Sinclair . Convergence to approximate nash equilibria in congestion games . In Proc. 18th ACM-SIAM Symp. on Discrete Algorithms (SODA) , 2007 . Steve Chien and Alistair Sinclair. Convergence to approximate nash equilibria in congestion games. In Proc. 18th ACM-SIAM Symp. on Discrete Algorithms (SODA), 2007."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/11672142_28"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1060590.1060600"},{"key":"e_1_3_2_1_10_1","first-page":"413","volume-title":"SODA","author":"Czumaj Artur","year":"2002","unstructured":"Artur Czumaj and Berthold V\u00f6cking . Tight bounds for worst-case equilibria . In SODA , pages 413 -- 420 , 2002 . Artur Czumaj and Berthold V\u00f6cking. Tight bounds for worst-case equilibria. In SODA, pages 413--420, 2002."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1132516.1132527"},{"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.1007\/978-3-540-70575-8_65"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1248377.1248433"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2005.09.024"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/989459.989467"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2005.68"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(88)90046-3"},{"key":"e_1_3_2_1_19_1","volume-title":"Approximation Algorithms for Distributed and Selfish Agents","author":"Mirrokni V. S.","year":"2005","unstructured":"V. S. Mirrokni . Approximation Algorithms for Distributed and Selfish Agents . Massachusetts Institute of Technology , 2005 . V. S. Mirrokni. Approximation Algorithms for Distributed and Selfish Agents. Massachusetts Institute of Technology, 2005."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-27821-4_17"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/380752.380883"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01737559"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/506147.506153"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1137\/0220004"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1374376.1374428"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.5555\/645413.652124"}],"event":{"name":"EC '08: ACM Conference on Electronic Commerce","location":"Chicago Il USA","acronym":"EC '08","sponsor":["ACM Association for Computing Machinery","SIGecom Special Interest Group on Economics and Computation"]},"container-title":["Proceedings of the 9th ACM conference on Electronic commerce"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1386790.1386832","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1386790.1386832","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T13:57:48Z","timestamp":1750255068000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1386790.1386832"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,7,8]]},"references-count":26,"alternative-id":["10.1145\/1386790.1386832","10.1145\/1386790"],"URL":"https:\/\/doi.org\/10.1145\/1386790.1386832","relation":{},"subject":[],"published":{"date-parts":[[2008,7,8]]},"assertion":[{"value":"2008-07-08","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}