{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,27]],"date-time":"2025-08-27T16:27:17Z","timestamp":1756312037180,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662541098"},{"type":"electronic","value":"9783662541104"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-662-54110-4_25","type":"book-chapter","created":{"date-parts":[[2016,12,10]],"date-time":"2016-12-10T08:48:58Z","timestamp":1481359738000},"page":"354-368","source":"Crossref","is-referenced-by-count":4,"title":["On the Price of Stability of Undirected Multicast Games"],"prefix":"10.1007","author":[{"given":"Rupert","family":"Freeman","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Samuel","family":"Haney","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Debmalya","family":"Panigrahi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,12,11]]},"reference":[{"issue":"6","key":"25_CR1","doi-asserted-by":"crossref","first-page":"2273","DOI":"10.1137\/070701376","volume":"38","author":"S Albers","year":"2009","unstructured":"Albers, S.: On the value of coordination in network design. SIAM J. Comput. 38(6), 2273\u20132302 (2009)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"25_CR2","doi-asserted-by":"crossref","first-page":"1602","DOI":"10.1137\/070680096","volume":"38","author":"E Anshelevich","year":"2008","unstructured":"Anshelevich, E., Dasgupta, A., Kleinberg, J.M., Tardos, \u00c9., Wexler, T., Roughgarden, T.: The price of stability for network design with fair cost allocation. SIAM J. Comput. 38(4), 1602\u20131623 (2008)","journal-title":"SIAM J. Comput."},{"issue":"1\u20132","key":"25_CR3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1142\/S0219265911002824","volume":"12","author":"V Bil\u00f2","year":"2011","unstructured":"Bil\u00f2, V., Bove, R.: Bounds on the price of stability of undirected network design games with three players. J. Interconnect. Netw. 12(1\u20132), 1\u201317 (2011)","journal-title":"J. Interconnect. Netw."},{"issue":"4","key":"25_CR4","doi-asserted-by":"crossref","first-page":"668","DOI":"10.1007\/s00224-012-9411-6","volume":"52","author":"V Bil\u00f2","year":"2013","unstructured":"Bil\u00f2, V., Caragiannis, I., Fanelli, A., Monaco, G.: Improved lower bounds on the price of stability of undirected network design games. Theory Comput. Syst. 52(4), 668\u2013686 (2013)","journal-title":"Theory Comput. Syst."},{"key":"25_CR5","doi-asserted-by":"crossref","unstructured":"Bil\u00f2, V., Flammini, M., Moscardelli, L.: The price of stability for undirected broadcast network design with fair cost allocation is constant. In: FOCS, pp. 638\u2013647 (2013)","DOI":"10.1109\/FOCS.2013.74"},{"issue":"1","key":"25_CR6","doi-asserted-by":"crossref","first-page":"6","DOI":"10.1145\/2432622.2432628","volume":"60","author":"J Byrka","year":"2013","unstructured":"Byrka, J., Grandoni, F., Rothvo\u00df, T., Sanit\u00e0, L.: Steiner tree approximation via iterative randomized rounding. J. ACM 60(1), 6 (2013)","journal-title":"J. ACM"},{"issue":"1","key":"25_CR7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10107-009-0299-0","volume":"130","author":"D Chakrabarty","year":"2011","unstructured":"Chakrabarty, D., Devanur, N.R., Vazirani, V.V.: New geometry-inspired relaxations and algorithms for the metric steiner tree problem. Math. Program. 130(1), 1\u201332 (2011)","journal-title":"Math. Program."},{"key":"25_CR8","doi-asserted-by":"crossref","unstructured":"Charikar, M., Karlo, H.J., Mathieu, C., Naor, J., Saks, M.E.: Online multicast with egalitarian cost sharing. In: Proceedings of the 20th Annual ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2008, Munich, Germany, 14\u201316 June 2008, pp. 70\u201376 (2008)","DOI":"10.1145\/1378533.1378544"},{"issue":"2","key":"25_CR9","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1007\/s00224-008-9128-8","volume":"45","author":"H-L Chen","year":"2009","unstructured":"Chen, H.-L., Roughgarden, T.: Network design with weighted players. Theory Comput. Syst. 45(2), 302\u2013324 (2009)","journal-title":"Theory Comput. Syst."},{"key":"25_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1007\/978-3-642-12450-1_8","volume-title":"Approximation and Online Algorithms","author":"G Christodoulou","year":"2010","unstructured":"Christodoulou, G., Chung, C., Ligett, K., Pyrga, E., Stee, R.: On the price of stability for undirected network design. In: Bampis, E., Jansen, K. (eds.) WAOA 2009. LNCS, vol. 5893, pp. 86\u201397. Springer, Heidelberg (2010). doi: 10.1007\/978-3-642-12450-1_8"},{"issue":"1","key":"25_CR11","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/j.geb.2008.07.002","volume":"67","author":"A Epstein","year":"2009","unstructured":"Epstein, A., Feldman, M., Mansour, Y.: Strong equilibrium in cost sharing connection games. Games Econ. Behav. 67(1), 51\u201368 (2009)","journal-title":"Games Econ. Behav."},{"key":"25_CR12","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1016\/j.tcs.2014.09.035","volume":"562","author":"A Fanelli","year":"2015","unstructured":"Fanelli, A., Leniowski, D., Monaco, G., Sankowski, P.: The ring design game with fair cost allocation. Theor. Comput. Sci. 562, 90\u2013100 (2015)","journal-title":"Theor. Comput. Sci."},{"key":"25_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"608","DOI":"10.1007\/11786986_53","volume-title":"Automata, Languages and Programming","author":"A Fiat","year":"2006","unstructured":"Fiat, A., Kaplan, H., Levy, M., Olonetsky, S., Shabo, R.: On the price of stability for designing undirected networks with fair cost allocations. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol. 4051, pp. 608\u2013618. Springer, Heidelberg (2006). doi: 10.1007\/11786986_53"},{"key":"25_CR14","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/j.tcs.2013.02.031","volume":"482","author":"Y Kawase","year":"2013","unstructured":"Kawase, Y., Makino, K.: Nash equilibria with minimum potential in undirected broadcast games. Theor. Comput. Sci. 482, 33\u201347 (2013)","journal-title":"Theor. Comput. Sci."},{"key":"25_CR15","doi-asserted-by":"crossref","unstructured":"Lee, E., Ligett, K.: Improved bounds on the price of stability in network cost sharing games. In: EC, pp. 607\u2013620 (2013)","DOI":"10.1145\/2492002.2482562"},{"issue":"15","key":"25_CR16","doi-asserted-by":"crossref","first-page":"876","DOI":"10.1016\/j.ipl.2009.04.015","volume":"109","author":"J Li","year":"2009","unstructured":"Li, J.: An o(log(n)\/log(log(n))) upper bound on the price of stability for undirected shapley network design games. Inf. Process. Lett. 109(15), 876\u2013878 (2009)","journal-title":"Inf. Process. Lett."},{"key":"25_CR17","unstructured":"Rajagopalan, S., Vazirani, V.V.: On the bidirected cut relaxation for the metric steiner tree problem. In: SODA, pp. 742\u2013751 (1999)"},{"issue":"1","key":"25_CR18","doi-asserted-by":"crossref","first-page":"122","DOI":"10.1137\/S0895480101393155","volume":"19","author":"G Robins","year":"2005","unstructured":"Robins, G., Zelikovsky, A.: Tighter bounds for graph steiner tree approximation. SIAM J. Discret. Math. 19(1), 122\u2013134 (2005)","journal-title":"SIAM J. Discret. Math."},{"issue":"1","key":"25_CR19","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1007\/BF01737559","volume":"2","author":"RW Rosenthal","year":"1973","unstructured":"Rosenthal, R.W.: A class of games possessing pure-strategy Nash equilibria. Int. J. Game Theory 2(1), 65\u201367 (1973)","journal-title":"Int. J. Game Theory"}],"container-title":["Lecture Notes in Computer Science","Web and Internet Economics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-54110-4_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,25]],"date-time":"2017-06-25T01:40:44Z","timestamp":1498354844000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-54110-4_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662541098","9783662541104"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-54110-4_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}