{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T12:18:17Z","timestamp":1743077897242,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642041273"},{"type":"electronic","value":"9783642041280"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-04128-0_21","type":"book-chapter","created":{"date-parts":[[2009,9,14]],"date-time":"2009-09-14T14:16:36Z","timestamp":1252937796000},"page":"239-250","source":"Crossref","is-referenced-by-count":8,"title":["Exact and Approximate Equilibria for Optimal Group Network Formation"],"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":[{"issue":"4","key":"21_CR1","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":"21_CR2","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":"21_CR3","doi-asserted-by":"crossref","unstructured":"Anshelevich, E., Karagiozova, A.: Terminal Backup, 3D Matching, and Covering Cubic Graphs. In: Proc. 39th ACM Symposium on Theory of Computing (2007)","DOI":"10.1145\/1250790.1250849"},{"key":"21_CR4","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":"21_CR5","doi-asserted-by":"crossref","unstructured":"Chen, H., Roughgarden, T.: Network Design with Weighted Players. In: SPAA 2006 (2006)","DOI":"10.1145\/1148109.1148114"},{"key":"21_CR6","unstructured":"Chen, H., Roughgarden, T., Valiant, G.: Designing Networks with Good Equilibria. In: SODA 2008 (2008)"},{"key":"21_CR7","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":"21_CR8","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":"21_CR9","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":"21_CR10","doi-asserted-by":"crossref","unstructured":"Garg, N., Konjevod, G., Ravi, R.: A polylogarithmic approximation algorithm for the group Steiner tree problem. In: SODA 2000 (2000)","DOI":"10.1006\/jagm.2000.1096"},{"key":"21_CR11","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1137\/S0097539793242618","volume":"24","author":"M. Goemans","year":"1995","unstructured":"Goemans, M., Williamson, D.: A General Approximation Technique for Constrained Forest Problems. SIAM Journal on Computing\u00a024, 296\u2013317 (1995)","journal-title":"SIAM Journal on Computing"},{"key":"21_CR12","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":"21_CR13","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":"21_CR14","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":"21_CR15","doi-asserted-by":"crossref","unstructured":"Holzman, R., Law-Yone, N.: Strong Equilibrium in congestion games. Games and Economic Behavior\u00a021 (1997)","DOI":"10.1006\/game.1997.0592"},{"key":"21_CR16","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"},{"key":"21_CR17","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":"21_CR18","unstructured":"Nisan, N., Roughgarden, T., Tardos, \u00c9., Vazirani, V.V. (eds.): Algorithmic Game Theory. Cambridge University Press, Cambridge"},{"key":"21_CR19","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":"21_CR20","unstructured":"Roughgarden, T.: Selfish Routing and the Price of Anarchy. MIT Press, Cambridge"},{"key":"21_CR21","doi-asserted-by":"crossref","unstructured":"Xu, D., Anshelevich, E., Chiang, M.: On Survivable Access Network Design: Complexity and Algorithms. In: INFOCOM 2008 (2008)","DOI":"10.1109\/INFOCOM.2008.46"}],"container-title":["Lecture Notes in Computer Science","Algorithms - ESA 2009"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-04128-0_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T12:35:08Z","timestamp":1558269308000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04128-0_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642041273","9783642041280"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04128-0_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}