{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,3]],"date-time":"2023-09-03T23:26:34Z","timestamp":1693783594312},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2011,3,10]],"date-time":"2011-03-10T00:00:00Z","timestamp":1299715200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2011,7]]},"DOI":"10.1007\/s00224-011-9317-8","type":"journal-article","created":{"date-parts":[[2011,3,9]],"date-time":"2011-03-09T07:35:47Z","timestamp":1299656147000},"page":"98-138","source":"Crossref","is-referenced-by-count":10,"title":["Price of Stability in Survivable Network Design"],"prefix":"10.1007","volume":"49","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","published-online":{"date-parts":[[2011,3,10]]},"reference":[{"key":"9317_CR1","volume-title":"SODA","author":"S. Albers","year":"2006","unstructured":"Albers, S., Eilts, S., Even-Dar, E., Mansour, Y., Roditty, L.: On Nash equilibria for a network creation game. In: SODA (2006)"},{"key":"9317_CR2","unstructured":"Agarwal, A., Charikar, M.: Unpublished manuscript"},{"key":"9317_CR3","volume-title":"Proc. 17th Annual European Symposium on Algorithms","author":"E. Anshelevich","year":"2009","unstructured":"Anshelevich, E., Caskurlu, B.: Exact and approximate equilibria for optimal group network formation. In: Proc. 17th Annual European Symposium on Algorithms (2009)"},{"key":"9317_CR4","volume-title":"Proc. 45th Annual IEEE Symposium on Foundations of Computer Science","author":"E. Anshelevich","year":"2004","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)"},{"key":"9317_CR5","volume-title":"Proc. 35th ACM Symposium on Theory of Computing","author":"E. Anshelevich","year":"2003","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)"},{"key":"9317_CR6","volume-title":"FOCS","author":"E. Anshelevich","year":"2006","unstructured":"Anshelevich, E., Shepherd, B., Wilfong, G.: Strategic network formation through peering and service agreements. In: FOCS (2006)"},{"key":"9317_CR7","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1145\/1134707.1134716","volume-title":"Proceedings of the 7th ACM Conference on Electronic Commerce (EC)","author":"C. Chekuri","year":"2006","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)"},{"key":"9317_CR8","volume-title":"SPAA","author":"H. Chen","year":"2006","unstructured":"Chen, H., Roughgarden, T.: Network design with weighted players. In: SPAA (2006)"},{"key":"9317_CR9","volume-title":"ESA","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: ESA (2005)"},{"key":"9317_CR10","volume-title":"EC","author":"A. Epstein","year":"2007","unstructured":"Epstein, A., Feldman, M., Mansour, Y.: Strong equilibrium in cost-sharing connection games. In: EC (2007)"},{"key":"9317_CR11","volume-title":"PODC","author":"A. Fabrikant","year":"2003","unstructured":"Fabrikant, A., Luthra, A., Maneva, E., Papadimitriou, S., Shenker, S.: On a network creation game. In: PODC (2003)"},{"key":"9317_CR12","doi-asserted-by":"crossref","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. J. Comput. Syst. Sci. 63, 21\u201341 (2001)","journal-title":"J. Comput. Syst. Sci."},{"key":"9317_CR13","first-page":"608","volume-title":"Proceedings of ICALP","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: Proceedings of ICALP, pp. 608\u2013618 (2006)"},{"key":"9317_CR14","doi-asserted-by":"crossref","unstructured":"Herzog, S., Shenker, S., Estrin, D.: Sharing the \u201ccost\u201d of multicast trees: an axiomatic analysis. IEEE\/ACM Trans. Netw. (1997). doi: 10.1109\/90.650144","DOI":"10.1109\/90.650144"},{"key":"9317_CR15","volume-title":"ISAAC","author":"M. Hoefer","year":"2006","unstructured":"Hoefer, M.: Non-cooperative facility location and covering games. In: ISAAC (2006)"},{"key":"9317_CR16","volume-title":"MFCS","author":"M. Hoefer","year":"2006","unstructured":"Hoefer, M.: Non-cooperative tree creation. In: MFCS (2006)"},{"key":"9317_CR17","volume-title":"COCOON","author":"M. Hoefer","year":"2005","unstructured":"Hoefer, M., Krysta, P.: Geometric network design with selfish agents. In: COCOON (2005)"},{"key":"9317_CR18","doi-asserted-by":"crossref","unstructured":"Holzman, R., Law-Yone, N.: Strong equilibrium in congestion games. Games Econ. Behav. 21 (1997)","DOI":"10.1006\/game.1997.0592"},{"key":"9317_CR19","unstructured":"Jackson, M.: A survey of models of network formation: stability and efficiency. G. Demange, M. Wooders (eds.) Group Formation in Economics: Networks, Clubs and Coalitions, Cambridge University Press, Cambridge (2003)"},{"issue":"1","key":"9317_CR20","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1007\/s004930170004","volume":"21","author":"K. Jain","year":"2001","unstructured":"Jain, K.: A factor 2 approximation algorithm for the generalized Steiner network problem. Combinatorica 21(1), 39\u201360 (2001)","journal-title":"Combinatorica"},{"key":"9317_CR21","volume-title":"STOC","author":"K. Jain","year":"2001","unstructured":"Jain, K., Vazirani, V.: Applications of approximation algorithms to cooperative games. In: STOC (2001)"},{"key":"9317_CR22","doi-asserted-by":"crossref","unstructured":"Johari, R., Tsitsiklis, J.: Efficiency loss in a network resource allocation game. Math. Oper. Res. 29(3), 407\u2013435","DOI":"10.1287\/moor.1040.0091"},{"key":"9317_CR23","volume-title":"SODA","author":"J. K\u00f6nemann","year":"2005","unstructured":"K\u00f6nemann, J., Leonardi, S., Sch\u00e4fer, G.: A group-strategyproof mechanism for Steiner forests. In: SODA (2005)"},{"key":"9317_CR24","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1006\/game.1996.0044","volume":"14","author":"D. Monderer","year":"1996","unstructured":"Monderer, D., Shapley, L.: Potential games. Games Econ. Behav. 14, 124\u2013143 (1996)","journal-title":"Potential games. Games Econ. Behav."},{"key":"9317_CR25","unstructured":"Nisan, N., Roughgarden, T., Tardos, \u00c9., Vazirani, V.V. (eds.): Algorithmic Game Theory, Cambridge University Press, Cambridge"},{"key":"9317_CR26","doi-asserted-by":"crossref","unstructured":"Roughgarden, T.: Selfish Routing and the Price of Anarchy. MIT Press, Cambridge (2005)","DOI":"10.21236\/ADA637949"},{"key":"9317_CR27","volume-title":"Proceedings of the 36th Annual ACM Symposium on the Theory of Computing","author":"\u00c9. Tardos","year":"2004","unstructured":"Tardos, \u00c9.: Network games. In: Proceedings of the 36th Annual ACM Symposium on the Theory of Computing (2004)"}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-011-9317-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00224-011-9317-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-011-9317-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,9]],"date-time":"2019-06-09T05:02:16Z","timestamp":1560056536000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00224-011-9317-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,3,10]]},"references-count":27,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2011,7]]}},"alternative-id":["9317"],"URL":"https:\/\/doi.org\/10.1007\/s00224-011-9317-8","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"value":"1432-4350","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,3,10]]}}}