{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:13:30Z","timestamp":1759637610621},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642046445"},{"type":"electronic","value":"9783642046452"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-04645-2_19","type":"book-chapter","created":{"date-parts":[[2009,10,7]],"date-time":"2009-10-07T11:14:23Z","timestamp":1254914063000},"page":"208-219","source":"Crossref","is-referenced-by-count":8,"title":["Price of Stability in Survivable Network Design"],"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"}]}],"member":"297","reference":[{"key":"19_CR1","doi-asserted-by":"crossref","unstructured":"Albers, S., Eilts, S., Even-Dar, E., Mansour, Y., Roditty, L.: On Nash Equilibria for a Network Creation Game. In: SODA (2006)","DOI":"10.1145\/1109557.1109568"},{"key":"19_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/978-3-642-04128-0_21","volume-title":"ESA 2009","author":"E. Anshelevich","year":"2009","unstructured":"Anshelevich, E., Caskurlu, B.: Exact and Approximate Equilibria for Optimal Group Network Formation. In: Fiat, A., Sanders, P. (eds.) ESA 2009. LNCS, vol.\u00a05757, pp. 239\u2013250. Springer, Heidelberg (2009)"},{"key":"19_CR3","doi-asserted-by":"crossref","unstructured":"Anshelevich, E., Dasgupta, A., Kleinberg, J., Tardos, \u00c9., Wexler, T., Roughgarden, T.: The Price of Stability for Network Design with Fair Cost Allocation. In: Proc. 45th Annual IEEE Symposium on Foundations of Computer Science (2004)","DOI":"10.1109\/FOCS.2004.68"},{"key":"19_CR4","doi-asserted-by":"crossref","unstructured":"Anshelevich, E., Dasgupta, A., Tardos, \u00c9., Wexler, T.: Near-Optimal Network Design with Selfish Agents. In: Proc. 35th ACM Symposium on Theory of Computing (2003)","DOI":"10.1145\/780615.780617"},{"key":"19_CR5","doi-asserted-by":"crossref","unstructured":"Anshelevich, E., Shepherd, B., Wilfong, G.: Strategic Network Formation through Peering and Service Agreements. In: FOCS 2006 (2006)","DOI":"10.1109\/FOCS.2006.72"},{"key":"19_CR6","doi-asserted-by":"publisher","first-page":"1181","DOI":"10.1111\/1468-0262.00155","volume":"68","author":"V. Bala","year":"2000","unstructured":"Bala, V., Goyal, S.: A Non-Cooperative Model of Network Formation. Econometrica\u00a068, 1181\u20131229 (2000)","journal-title":"Econometrica"},{"key":"19_CR7","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":"19_CR8","doi-asserted-by":"crossref","unstructured":"Chen, H., Roughgarden, T.: Network Design with Weighted Players. In: SPAA 2006 (2006)","DOI":"10.1145\/1148109.1148114"},{"key":"19_CR9","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":"19_CR10","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":"19_CR11","doi-asserted-by":"crossref","unstructured":"Fabrikant, A., Luthra, A., Maneva, E., Papadimitriou, S., Shenker, S.: On a Network Creation Game. In: PODC (2003)","DOI":"10.1145\/872035.872088"},{"key":"19_CR12","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.\u00a04051, pp. 608\u2013618. Springer, Heidelberg (2006)"},{"key":"19_CR13","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":"19_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1007\/11821069_45","volume-title":"Mathematical Foundations of Computer Science 2006","author":"M. Hoefer","year":"2006","unstructured":"Hoefer, M.: Non-cooperative Tree Creation. In: Kr\u00e1lovi\u010d, R., Urzyczyn, P. (eds.) MFCS 2006. LNCS, vol.\u00a04162, pp. 517\u2013527. Springer, Heidelberg (2006)"},{"key":"19_CR15","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)"},{"key":"19_CR16","doi-asserted-by":"crossref","unstructured":"Jackson, M.: A survey of models of network formation: stability and efficiency. In: Demange, G., Wooders, M. (eds.) Group Formation in Economics: Networks, Clubs and Coalitions. Cambridge Univ. Press, Cambridge","DOI":"10.1017\/CBO9780511614385.002"},{"key":"19_CR17","doi-asserted-by":"crossref","unstructured":"Jain, K.: A Factor 2 Approximation Algorithm for the Generalized Steiner Network Problem. Combinatorica\u00a021 (2001)","DOI":"10.1007\/s004930170004"},{"key":"19_CR18","doi-asserted-by":"crossref","unstructured":"Johari, R., Tsitsiklis, J.: Efficiency loss in a network resource allocation game. Mathematics of Operations Research\u00a029(3), 407\u2013435","DOI":"10.1287\/moor.1040.0091"},{"key":"19_CR19","doi-asserted-by":"crossref","unstructured":"Li, J.: An $O \\left(\\frac{log n}{log log n}\\right)$ upper bound on the price of stability for undirected Shapley network design games. Information Processing Letters\u00a0109(15), 876\u2013878","DOI":"10.1016\/j.ipl.2009.04.015"},{"key":"19_CR20","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1006\/game.1996.0044","volume":"14","author":"D. Monderer","year":"1996","unstructured":"Monderer, D., Shapley, L.: Potential Games. Games and Economic Behavior\u00a014, 124\u2013143 (1996)","journal-title":"Games and Economic Behavior"},{"key":"19_CR21","unstructured":"Nisan, N., Roughgarden, T., Tardos, \u00c9., Vazirani, V.V. (eds.): Algorithmic Game Theory. Cambridge University Press, Cambridge"},{"key":"19_CR22","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1002\/net.3230030104","volume":"3","author":"R.W. Rosenthal","year":"1973","unstructured":"Rosenthal, R.W.: The network equilibrium problem in integers. Networks\u00a03, 53\u201359 (1973)","journal-title":"Networks"},{"key":"19_CR23","unstructured":"Roughgarden, T.: Selfish Routing and the Price of Anarchy. MIT Press, Cambridge"},{"key":"19_CR24","doi-asserted-by":"crossref","unstructured":"Tardos, \u00c9.: Network Games. In: Proceedings of the 36th Annual ACM Symposium on the Theory of Computing (2004)","DOI":"10.1145\/1007352.1007356"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Game Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-04645-2_19.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:43:02Z","timestamp":1606185782000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04645-2_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642046445","9783642046452"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04645-2_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}