{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:22:39Z","timestamp":1750306959545,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":23,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,6,16]],"date-time":"2013-06-16T00:00:00Z","timestamp":1371340800000},"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":[[2013,6,16]]},"DOI":"10.1145\/2492002.2482562","type":"proceedings-article","created":{"date-parts":[[2013,6,11]],"date-time":"2013-06-11T16:03:50Z","timestamp":1370966630000},"page":"607-620","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":9,"title":["Improved bounds on the price of stability in network cost sharing games"],"prefix":"10.1145","author":[{"given":"Euiwoong","family":"Lee","sequence":"first","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, PA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Katrina","family":"Ligett","sequence":"additional","affiliation":[{"name":"California Institute of Technology, Pasadena, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2013,6,16]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms. SODA '08. Society for Industrial and Applied Mathematics","author":"Albers S.","year":"2008","unstructured":"Albers , S. 2008 . On the value of coordination in network design . In Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms. SODA '08. Society for Industrial and Applied Mathematics , Philadelphia, PA, USA, 294--303. Albers, S. 2008. On the value of coordination in network design. In Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms. SODA '08. Society for Industrial and Applied Mathematics, Philadelphia, PA, USA, 294--303."},{"key":"e_1_3_2_1_2_1","volume-title":"Eds. Lecture Notes in Computer Science Series","volume":"5757","author":"Anshelevich E.","unstructured":"Anshelevich , E. and Caskurlu , B . 2009a. Exact and approximate equilibria for optimal group network formation. In Algorithms - ESA 2009, A. Fiat and P. Sanders , Eds. Lecture Notes in Computer Science Series , vol. 5757 . Springer Berlin Heidelberg, 239--250. Anshelevich, E. and Caskurlu, B. 2009a. Exact and approximate equilibria for optimal group network formation. In Algorithms - ESA 2009, A. Fiat and P. Sanders, Eds. Lecture Notes in Computer Science Series, vol. 5757. Springer Berlin Heidelberg, 239--250."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-04645-2_19"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2004.68"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/780542.780617"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(89)90039-2"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"crossref","unstructured":"Bil\u00f2 V. and Bove R. 2011. Bounds on the price of stability of undirected network design games with three players. In Journal of Interconnection Networks. Vol. 12. 1--17.  Bil\u00f2 V. and Bove R. 2011. Bounds on the price of stability of undirected network design games with three players. In Journal of Interconnection Networks. Vol. 12. 1--17.","DOI":"10.1142\/S0219265911002824"},{"volume-title":"Proceedings of the 3rd International Symposium on Algorithmic Game Theory. SAGT '10","author":"Bil\u00f2 V.","key":"e_1_3_2_1_8_1","unstructured":"Bil\u00f2 , V. , Caragiannis , I. , Fanelli , A. , and Monaco , G . 2010. Improved lower bounds on the price of stability of undirected network design games . In Proceedings of the 3rd International Symposium on Algorithmic Game Theory. SAGT '10 . Springer-Verlag, Berlin, Heidelberg, 90--101. Bil\u00f2, V., Caragiannis, I., Fanelli, A., and Monaco, G. 2010. Improved lower bounds on the price of stability of undirected network design games. In Proceedings of the 3rd International Symposium on Algorithmic Game Theory. SAGT '10. Springer-Verlag, Berlin, Heidelberg, 90--101."},{"volume-title":"Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms. SODA '98","author":"Charikar M.","key":"e_1_3_2_1_9_1","unstructured":"Charikar , M. , Chekuri , C. , Cheung , T.-y. , Dai , Z. , Goel , A. , Guha , S. , and Li , M . 1998. Approximation algorithms for directed steiner problems . In Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms. SODA '98 . Society for Industrial and Applied Mathematics, Philadelphia, PA, USA, 192--200. Charikar, M., Chekuri, C., Cheung, T.-y., Dai, Z., Goel, A., Guha, S., and Li, M. 1998. Approximation algorithms for directed steiner problems. In Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms. SODA '98. Society for Industrial and Applied Mathematics, Philadelphia, PA, USA, 192--200."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1378533.1378544"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/11944874_11"},{"volume-title":"Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms. SODA '08. Society for Industrial and Applied Mathematics","author":"Chekuri C.","key":"e_1_3_2_1_12_1","unstructured":"Chekuri , C. , Even , G. , Gupta , A. , and Segev , D . 2008. Set connectivity problems in undirected graphs and the directed steiner network problem . In Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms. SODA '08. Society for Industrial and Applied Mathematics , Philadelphia, PA, USA, 532--541. Chekuri, C., Even, G., Gupta, A., and Segev, D. 2008. Set connectivity problems in undirected graphs and the directed steiner network problem. In Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms. SODA '08. Society for Industrial and Applied Mathematics, Philadelphia, PA, USA, 532--541."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-12450-1_8"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250910.1250924"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/11786986_53"},{"volume-title":"Proceedings of the 3rd Annual ACM-SIAM Symposium on Discrete Algorithms. SODA '92","author":"Goemans M. X.","key":"e_1_3_2_1_16_1","unstructured":"Goemans , M. X. and Williamson , D. P . 1992. A general approximation technique for constrained forest problems . In Proceedings of the 3rd Annual ACM-SIAM Symposium on Discrete Algorithms. SODA '92 . Society for Industrial and Applied Mathematics, Philadelphia, PA, USA, 307--316. Goemans, M. X. and Williamson, D. P. 1992. A general approximation technique for constrained forest problems. In Proceedings of the 3rd Annual ACM-SIAM Symposium on Discrete Algorithms. SODA '92. Society for Industrial and Applied Mathematics, Philadelphia, PA, USA, 307--316."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/11821069_45"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.5555\/1940179.1940201"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-28076-4_22"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2009.04.015"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1566374.1566378"},{"volume-title":"Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms. SODA '00. Society for Industrial and Applied Mathematics","author":"Robins G.","key":"e_1_3_2_1_22_1","unstructured":"Robins , G. and Zelikovsky , A . 2000. Improved steiner tree approximation in graphs . In Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms. SODA '00. Society for Industrial and Applied Mathematics , Philadelphia, PA, USA, 770--779. Robins, G. and Zelikovsky, A. 2000. Improved steiner tree approximation in graphs. In Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms. SODA '00. Society for Industrial and Applied Mathematics, Philadelphia, PA, USA, 770--779."},{"volume-title":"Approximation algorithms","author":"Vazirani V. V.","key":"e_1_3_2_1_23_1","unstructured":"Vazirani , V. V. 2001. Approximation algorithms . Springer . Vazirani, V. V. 2001. Approximation algorithms. Springer."}],"event":{"name":"EC '13: ACM Conference on Electronic Commerce","sponsor":["SIGecom Special Interest Group on Economics and Computation"],"location":"Philadelphia Pennsylvania USA","acronym":"EC '13"},"container-title":["Proceedings of the fourteenth ACM conference on Electronic commerce"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2492002.2482562","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2492002.2482562","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:39:11Z","timestamp":1750235951000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2492002.2482562"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,6,16]]},"references-count":23,"alternative-id":["10.1145\/2492002.2482562","10.1145\/2492002"],"URL":"https:\/\/doi.org\/10.1145\/2492002.2482562","relation":{},"subject":[],"published":{"date-parts":[[2013,6,16]]},"assertion":[{"value":"2013-06-16","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}