{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T12:19:25Z","timestamp":1742991565198,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642303722"},{"type":"electronic","value":"9783642303739"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"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":[[2012]]},"DOI":"10.1007\/978-3-642-30373-9_45","type":"book-chapter","created":{"date-parts":[[2012,5,30]],"date-time":"2012-05-30T00:14:47Z","timestamp":1338336887000},"page":"658-673","source":"Crossref","is-referenced-by-count":0,"title":["Capacity Allocation Games for Network-Coded Multicast Streaming"],"prefix":"10.1007","author":[{"given":"Elliot","family":"Anshelevich","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bugra","family":"Caskurlu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Koushik","family":"Kar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hang","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"45_CR1","unstructured":"Web could collapse as video demand soars. Daily Telegraph (April 7, 2008)"},{"key":"45_CR2","unstructured":"ITU IPTV Focus Group, \n                    \n                      http:\/\/www.itu.int\/ITU-T\/IPTV\/"},{"key":"45_CR3","unstructured":"Future Looks Bright For IPTV. Satellite Today (May 2, 2005)"},{"key":"45_CR4","unstructured":"http:\/\/www.youtube.com"},{"key":"45_CR5","unstructured":"Cisco Virtual Video Infrastructure Managing Complexity and Scale in a Next-Generation Video Network. White Paper, Cisco Systems (2008)"},{"issue":"4","key":"45_CR6","doi-asserted-by":"publisher","first-page":"1204","DOI":"10.1109\/18.850663","volume":"46","author":"R. Ahlswede","year":"2000","unstructured":"Ahlswede, R., Cai, N., Li, S., Yeung, R.: Network information flow. IEEE Trans. Inform. Theory\u00a046(4), 1204\u20131216 (2000)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"45_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1007\/978-3-642-04645-2_19","volume-title":"Algorithmic Game Theory","author":"E. Anshelevich","year":"2009","unstructured":"Anshelevich, E., Caskurlu, B.: Price of Stability in Survivable Network Design. In: Mavronicolas, M., Papadopoulou, V.G. (eds.) SAGT 2009. LNCS, vol.\u00a05814, pp. 208\u2013219. Springer, Heidelberg (2009)"},{"issue":"4","key":"45_CR8","doi-asserted-by":"publisher","first-page":"1602","DOI":"10.1137\/070680096","volume":"38","author":"E. Anshelevich","year":"2008","unstructured":"Anshelevich, E., Dasgupta, A., Kleinberg, J., Tardos, \u00c9., Wexler, T., Roughgarden, T.: The Price of Stability for Network Design with Fair Cost Allocation. SIAM Journal on Computing\u00a038(4), 1602\u20131623 (2008)","journal-title":"SIAM Journal on Computing"},{"key":"45_CR9","doi-asserted-by":"publisher","first-page":"77","DOI":"10.4086\/toc.2008.v004a004","volume":"4","author":"E. Anshelevich","year":"2008","unstructured":"Anshelevich, E., Dasgupta, A., Tardos, \u00c9., Wexler, T.: Near-Optimal Network Design with Selfish Agents. Theory of Computing\u00a04, 77\u2013109 (2008)","journal-title":"Theory of Computing"},{"key":"45_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1007\/978-3-642-16170-4_9","volume-title":"Algorithmic Game Theory","author":"V. Bil\u00f2","year":"2010","unstructured":"Bil\u00f2, V., Caragiannis, I., Fanelli, A., Monaco, G.: Improved Lower Bounds on the Price of Stability of Undirected Network Design Games. In: Kontogiannis, S., Koutsoupias, E., Spirakis, P.G. (eds.) SAGT 2010. LNCS, vol.\u00a06386, pp. 90\u2013101. Springer, Heidelberg (2010)"},{"key":"45_CR11","doi-asserted-by":"crossref","unstructured":"Chekuri, C., Chuzhoy, J., Lewin-Eytan, L., Naor, J., Orda, A.: Non-cooperative multicast and facility location games. In: Proceedings of the 7th ACM Conference on Electronic Commerce (EC), Ann Arbor, Michigan, pp. 72\u201381 (2006)","DOI":"10.1145\/1134707.1134716"},{"key":"45_CR12","doi-asserted-by":"crossref","unstructured":"Chen, H., Roughgarden, T.: Network Design with Weighted Players. In: SPAA (2006)","DOI":"10.1145\/1148109.1148114"},{"key":"45_CR13","unstructured":"Chen, H., Roughgarden, T., Valiant, G.: Designing Networks with Good Equilibria. In: SODA 2008 (2008)"},{"key":"45_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/11561071_8","volume-title":"Algorithms \u2013 ESA 2005","author":"G. Christodoulou","year":"2005","unstructured":"Christodoulou, G., Koutsoupias, E.: On the Price of Anarchy and Stability of Correlated Equilibria of Linear Congestion Games. In: Brodal, G.S., Leonardi, S. (eds.) ESA 2005. LNCS, vol.\u00a03669, pp. 59\u201370. Springer, Heidelberg (2005)"},{"key":"45_CR15","doi-asserted-by":"crossref","unstructured":"Epstein, A., Feldman, M., Mansour, Y.: Strong Equilibrium in Cost-Sharing Connection Games. In: EC 2007 (2007)","DOI":"10.1145\/1250910.1250924"},{"key":"45_CR16","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1006\/jcss.2001.1754","volume":"63","author":"J. Feigenbaum","year":"2001","unstructured":"Feigenbaum, J., Papadimitriou, C., Shenker, S.: Sharing the Cost of Multicast Transmissions. Journal of Computer and System Sciences\u00a063, 21\u201341 (2001)","journal-title":"Journal of Computer and System Sciences"},{"key":"45_CR17","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, Part I. LNCS, vol.\u00a04051, pp. 608\u2013618. Springer, Heidelberg (2006)"},{"key":"45_CR18","unstructured":"Ho, T., Medard, M., Shi, J., Effros, M., Karger, D.R.: On randomized network coding. In: Proc. 41st Annual Allerton Conf. Comm., Control, & Computing, Monticello, IL (October 2003)"},{"key":"45_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/11940128_38","volume-title":"Algorithms and Computation","author":"M. Hoefer","year":"2006","unstructured":"Hoefer, M.: Non-cooperative Facility Location and Covering Games. In: Asano, T. (ed.) ISAAC 2006. LNCS, vol.\u00a04288, pp. 369\u2013378. Springer, Heidelberg (2006)"},{"key":"45_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/11533719_19","volume-title":"Computing and Combinatorics","author":"M. Hoefer","year":"2005","unstructured":"Hoefer, M., Krysta, P.: Geometric Network Design with Selfish Agents. In: Wang, L. (ed.) COCOON 2005. LNCS, vol.\u00a03595, pp. 167\u2013178. Springer, Heidelberg (2005)"},{"issue":"2","key":"45_CR21","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1109\/TIT.2002.807285","volume":"49","author":"S.-Y.R. Li","year":"2003","unstructured":"Li, S.-Y.R., Yeung, R.W., Cai, N.: Linear network coding. IEEE Trans. Inform. Theory\u00a049(2), 317\u2013381 (2003)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"45_CR22","unstructured":"Nisan, N., Roughgarden, T., Tardos, \u00c9., Vazirani, V.V.(eds.): Algorithmic Game Theory. Cambridge University Press"},{"key":"45_CR23","doi-asserted-by":"crossref","unstructured":"Sanders, P., Egner, S., Tolhuizen, L.: Polynomial time algorithms for network information flow. In: Proc.of the Fifteenth Annual ACM Symposium on Parallel Algorithms and Architectures, pp. 286\u2013294 (2003)","DOI":"10.1145\/777412.777464"},{"key":"45_CR24","volume-title":"Approximation algorithms","author":"V.V. Vazirani","year":"2001","unstructured":"Vazirani, V.V.: Approximation algorithms. Springer, Berlin (2001)"}],"container-title":["Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering","Game Theory for Networks"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-30373-9_45","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T17:32:40Z","timestamp":1556818360000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-30373-9_45"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642303722","9783642303739"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-30373-9_45","relation":{},"ISSN":["1867-8211","1867-822X"],"issn-type":[{"type":"print","value":"1867-8211"},{"type":"electronic","value":"1867-822X"}],"subject":[],"published":{"date-parts":[[2012]]}}}