{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T16:57:26Z","timestamp":1725469046304},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540377917"},{"type":"electronic","value":"9783540377931"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11821069_45","type":"book-chapter","created":{"date-parts":[[2006,8,25]],"date-time":"2006-08-25T06:25:12Z","timestamp":1156487112000},"page":"517-527","source":"Crossref","is-referenced-by-count":8,"title":["Non-cooperative Tree Creation"],"prefix":"10.1007","author":[{"given":"Martin","family":"Hoefer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"45_CR1","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1137\/S0097539792236237","volume":"24","author":"A. Agrawal","year":"1995","unstructured":"Agrawal, A., Klein, P., Ravi, R.: When trees collide: An approximation algorithm for the generalized Steiner problem on networks. SIAM J Comp\u00a024(3), 445\u2013456 (1995)","journal-title":"SIAM J Comp"},{"key":"45_CR2","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: Proc 17th Ann ACM-SIAM Symp Discrete Algorithms (SODA), pp. 89\u201398 (2006)","DOI":"10.1145\/1109557.1109568"},{"key":"45_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 Ann IEEE Symp Foundations Comp Sci (FOCS), pp. 295\u2013304 (2004)","DOI":"10.1109\/FOCS.2004.68"},{"key":"45_CR4","doi-asserted-by":"crossref","unstructured":"Anshelevich, E., Dasgupta, A., Tardos, \u00c9., Wexler, T.: Near-optimal network design with selfish agents. In: Proc 35th Ann ACM Symp Theo Comp (STOC), pp. 511\u2013520 (2003)","DOI":"10.1145\/780615.780617"},{"key":"45_CR5","doi-asserted-by":"crossref","unstructured":"Corbo, J., Parkes, D.: The price of selfish behavior in bilateral network formation. In: Proc 24th Ann ACM Symp Principles of Distributed Comp, PODC (2005)","DOI":"10.1145\/1073814.1073833"},{"key":"45_CR6","doi-asserted-by":"crossref","unstructured":"Czumaj, A., Krysta, P., V\u00f6cking, B.: Selfish traffic allocation for server farms. In: Proc 34th Ann ACM Symp Theory Comp (STOC), pp. 287\u2013296 (2002)","DOI":"10.1145\/509907.509952"},{"key":"45_CR7","doi-asserted-by":"crossref","unstructured":"Fabrikant, A., Luthera, A., Maneva, E., Papadimitriou, C., Shenker, S.: On a network creation game. In: Proc 22nd Ann ACM Symp Principles of Distributed Comp (PODC), pp. 347\u2013351 (2003)","DOI":"10.1145\/872035.872088"},{"key":"45_CR8","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1006\/jagm.2000.1096","volume":"37","author":"N. Garg","year":"2000","unstructured":"Garg, N., Konjevod, G., Ravi, R.: A polylogarithmic approximation algorithm for the Group Steiner tree problem. J Algorithms\u00a037, 66\u201384 (2000)","journal-title":"J Algorithms"},{"issue":"2","key":"45_CR9","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1137\/S0097539793242618","volume":"24","author":"M. Goemams","year":"1995","unstructured":"Goemams, M., Williamson, D.: A general approximation technique for constrained forest problems. SIAM J Comp\u00a024(2), 296\u2013317 (1995)","journal-title":"SIAM J Comp"},{"key":"45_CR10","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":"45_CR11","volume-title":"Group Formation in Economics; Networks, Clubs and Coalitions, ch. 1","author":"M. Jackson","year":"2004","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, ch. 1. Cambridge University Press, Cambridge (2004)"},{"key":"45_CR12","doi-asserted-by":"crossref","unstructured":"Koutsoupias, E., Papadimitriou, C.: Worst-case equilibria. In: Proc 16th Ann Symp Theoretical Aspects Comp Sci (STACS), pp. 404\u2013413 (1999)","DOI":"10.1007\/3-540-49116-3_38"},{"key":"45_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1007\/3-540-52292-1_14","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"G. Reich","year":"1990","unstructured":"Reich, G., Widmayer, P.: Beyond Steiner\u2019s problem: A VLSI oriented generalization. In: Nagl, M. (ed.) WG 1989. LNCS, vol.\u00a0411, pp. 196\u2013210. Springer, Heidelberg (1990)"},{"key":"45_CR14","unstructured":"Robins, G., Zelikovsky, A.: Improved Steiner tree approximation in graphs. In: Proc 10th Ann ACM-SIAM Symp Discrete Algorithms (SODA), pp. 770\u2013779 (2000)"},{"issue":"2","key":"45_CR15","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1145\/506147.506153","volume":"49","author":"T. Roughgarden","year":"2002","unstructured":"Roughgarden, T., Tardos, \u00c9.: How bad is selfish routing? J ACM\u00a049(2), 236\u2013259 (2002)","journal-title":"J ACM"},{"issue":"4","key":"45_CR16","doi-asserted-by":"publisher","first-page":"961","DOI":"10.1287\/moor.1040.0098","volume":"29","author":"A. Schulz","year":"2004","unstructured":"Schulz, A., Stier Moses, N.: Selfish routing in capacitated networks. Math Oper Res\u00a029(4), 961\u2013976 (2004)","journal-title":"Math Oper Res"},{"key":"45_CR17","doi-asserted-by":"crossref","unstructured":"Vetta, A.: Nash equilibria in competitive societies with application to facility location, traffic routing and auctions. In: Proc 43rd Ann IEEE Symp Foundations Comp Sci (FOCS), p. 416 (2002)","DOI":"10.1109\/SFCS.2002.1181966"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11821069_45.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T15:16:36Z","timestamp":1605626196000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11821069_45"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540377917","9783540377931"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/11821069_45","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}