{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:23:28Z","timestamp":1750307008202,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":30,"publisher":"ACM","license":[{"start":{"date-parts":[[2012,6,4]],"date-time":"2012-06-04T00:00:00Z","timestamp":1338768000000},"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":[[2012,6,4]]},"DOI":"10.1145\/2229012.2229036","type":"proceedings-article","created":{"date-parts":[[2012,6,5]],"date-time":"2012-06-05T17:35:37Z","timestamp":1338917737000},"page":"284-301","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":9,"title":["Approximate pure nash equilibria in weighted congestion games"],"prefix":"10.1145","author":[{"given":"Ioannis","family":"Caragiannis","sequence":"first","affiliation":[{"name":"University of Patras and CTI, Patras, Greece"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Angelo","family":"Fanelli","sequence":"additional","affiliation":[{"name":"Nanyang Technological University, Singapore, Singapore"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nick","family":"Gravin","sequence":"additional","affiliation":[{"name":"Nanyang Technological University, Singapore, Singapore"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander","family":"Skopalik","sequence":"additional","affiliation":[{"name":"TU Dortmund, Dortmund, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2012,6,4]]},"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.1016\/j.tcs.2008.12.035"},{"volume-title":"Proceedings of the 17th Annual Symposium on Algorithms (ESA), LNCS 5757","author":"Anshelevich E.","key":"e_1_3_2_1_3_1","unstructured":"Anshelevich , E. and Caskurlu , B . 2009. Exact and approximate equilibria for optimal group network formation . In Proceedings of the 17th Annual Symposium on Algorithms (ESA), LNCS 5757 , Springer, 239--250. Anshelevich, E. and Caskurlu, B. 2009. Exact and approximate equilibria for optimal group network formation. In Proceedings of the 17th Annual Symposium on Algorithms (ESA), LNCS 5757, Springer, 239--250."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1386790.1386832"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807342.1807353"},{"volume-title":"Proceedings of the 50th IEEE Conference on Decision and Control and European Control Conference (CDC-ECE), 2428--2433","author":"Candogan O.","key":"e_1_3_2_1_6_1","unstructured":"Candogan , O. , Ozdaglar , A. E. , and Parrilo , P. A . 2011a. Learning in near-potential games . In Proceedings of the 50th IEEE Conference on Decision and Control and European Control Conference (CDC-ECE), 2428--2433 . Candogan, O., Ozdaglar, A. E., and Parrilo, P. A. 2011a. Learning in near-potential games. In Proceedings of the 50th IEEE Conference on Decision and Control and European Control Conference (CDC-ECE), 2428--2433."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"crossref","unstructured":"Candogan O. Ozdaglar A. E. and Parrilo P. A. 2011b. Dynamics in near-potential games. arxiv:1107.4386.  Candogan O. Ozdaglar A. E. and Parrilo P. A. 2011b. Dynamics in near-potential games. arxiv:1107.4386.","DOI":"10.1109\/CDC.2011.6160867"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/1496770.1496859"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2011.50"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2010.02.005"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1378533.1378544"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2007.070813"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.geb.2009.05.004"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1016527.1016536"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/11672142_28"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2007.19"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.1080.0322"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1273340.1273348"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2005.03.013"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007352.1007445"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-10841-9_7"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2005.68"},{"volume-title":"Proceedings of the 37th International Colloquium on Automata, Languages and Programming (ICALP), Part 1, LNCS 6198","author":"Harks T.","key":"e_1_3_2_1_23_1","unstructured":"Harks , T. and Klimm , M . 2010. On the existence of pure Nash equilibria in weighted congestion games . In Proceedings of the 37th International Colloquium on Automata, Languages and Programming (ICALP), Part 1, LNCS 6198 , Springer, 79--89. Harks, T. and Klimm, M. 2010. On the existence of pure Nash equilibria in weighted congestion games. In Proceedings of the 37th International Colloquium on Automata, Languages and Programming (ICALP), Part 1, LNCS 6198, Springer, 79--89."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(88)90046-3"},{"key":"e_1_3_2_1_25_1","first-page":"539","article-title":"Restoring pure equilibria to weighted congestion games. In Proceedings of the 38th International Colloquium on Automata, Languages and Programming (ICALP), Part II","author":"Kollias K.","year":"2011","unstructured":"Kollias , K. and Roughgarden , T. 2011 . Restoring pure equilibria to weighted congestion games. In Proceedings of the 38th International Colloquium on Automata, Languages and Programming (ICALP), Part II , LNCS 6756 , Spring er, 539 -- 551 . Kollias, K. and Roughgarden, T. 2011. Restoring pure equilibria to weighted congestion games. In Proceedings of the 38th International Colloquium on Automata, Languages and Programming (ICALP), Part II, LNCS 6756, Springer, 539--551.","journal-title":"LNCS 6756"},{"volume-title":"Proceedings of the 7th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX),LNCS 3122","author":"Mirrokni V. S.","key":"e_1_3_2_1_26_1","unstructured":"Mirrokni , V. S. and Vetta , A . 2004. Convergence issues in competitive games . In Proceedings of the 7th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX),LNCS 3122 , Springer, 183--192. Mirrokni, V. S. and Vetta, A. 2004. Convergence issues in competitive games. In Proceedings of the 7th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX),LNCS 3122, Springer, 183--192."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-10841-9_16"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/1187436.1216584"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01737559"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/1374376.1374428"}],"event":{"name":"EC '12: ACM Conference on Electronic Commerce","sponsor":["SIGecom Special Interest Group on Economics and Computation"],"location":"Valencia Spain","acronym":"EC '12"},"container-title":["Proceedings of the 13th ACM Conference on Electronic Commerce"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2229012.2229036","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2229012.2229036","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:48:59Z","timestamp":1750236539000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2229012.2229036"}},"subtitle":["existence, efficient computation, and structure"],"short-title":[],"issued":{"date-parts":[[2012,6,4]]},"references-count":30,"alternative-id":["10.1145\/2229012.2229036","10.1145\/2229012"],"URL":"https:\/\/doi.org\/10.1145\/2229012.2229036","relation":{},"subject":[],"published":{"date-parts":[[2012,6,4]]},"assertion":[{"value":"2012-06-04","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}