{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,3]],"date-time":"2023-09-03T23:26:10Z","timestamp":1693783570277},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2007,9,8]],"date-time":"2007-09-08T00:00:00Z","timestamp":1189209600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2009,1]]},"DOI":"10.1007\/s00453-007-9014-9","type":"journal-article","created":{"date-parts":[[2007,9,7]],"date-time":"2007-09-07T05:23:31Z","timestamp":1189142611000},"page":"104-131","source":"Crossref","is-referenced-by-count":18,"title":["Non-Cooperative Tree Creation"],"prefix":"10.1007","volume":"53","author":[{"given":"Martin","family":"Hoefer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2007,9,8]]},"reference":[{"issue":"3","key":"9014_CR1","doi-asserted-by":"crossref","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\u00a0approximation algorithm for the generalized Steiner problem on networks. SIAM J. Comput. 24(3), 445\u2013456 (1995)","journal-title":"SIAM J. Comput."},{"key":"9014_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.\u00a089\u201398 (2006)","DOI":"10.1145\/1109557.1109568"},{"key":"9014_CR3","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.\u00a0511\u2013520 (2003)","DOI":"10.1145\/780542.780617"},{"key":"9014_CR4","doi-asserted-by":"crossref","unstructured":"Anshelevich, E., Dasgupta, A., Kleinberg, J., Roughgarden, T., Tardos, \u00c9., Wexler, T.: The price of stability for network design with fair cost allocation. In: Proc. 45th Ann. IEEE Symp. Foundations Comp. Sci. (FOCS), pp.\u00a0295\u2013304 (2004)","DOI":"10.1109\/FOCS.2004.68"},{"key":"9014_CR5","doi-asserted-by":"crossref","unstructured":"Cardinal, J., Hoefer, M.: Selfish serive installation in networks. In: Proc. 2nd Workshop Internet & Network Economics (WINE) (2006)","DOI":"10.1007\/11944874_17"},{"key":"9014_CR6","doi-asserted-by":"crossref","unstructured":"Chen, H.-L., Roughgarden, T.: Network design with weighted players. In: Proc. 18th Symp. Parallelism in Algorithms and Architectures (SPAA), pp.\u00a029\u201338 (2006)","DOI":"10.1145\/1148109.1148114"},{"key":"9014_CR7","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), pp.\u00a099\u2013107 (2005)","DOI":"10.1145\/1073814.1073833"},{"key":"9014_CR8","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.\u00a0287\u2013296 (2002)","DOI":"10.1145\/509907.509952"},{"key":"9014_CR9","doi-asserted-by":"crossref","unstructured":"Demaine, E., Mahini, H., Hajiaghayi, M.T., Zadimoghaddam, M.: The price of anarchy in network creation games. In: Proc. 26th Ann. ACM Symp. Principles of Distributed Comp. (PODC) (2007)","DOI":"10.1145\/1281100.1281142"},{"key":"9014_CR10","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1002\/net.3230010302","volume":"1","author":"S.E. Dreyfus","year":"1972","unstructured":"Dreyfus, S.E., Wagner, R.A.: The steiner problem in graphs. Networks 1, 195\u2013207 (1972)","journal-title":"Networks"},{"key":"9014_CR11","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.\u00a0347\u2013351 (2003)","DOI":"10.1145\/872035.872088"},{"issue":"2","key":"9014_CR12","doi-asserted-by":"crossref","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. Comput. 24(2), 296\u2013317 (1995)","journal-title":"SIAM J. Comput."},{"key":"9014_CR13","doi-asserted-by":"crossref","unstructured":"Hoefer, M.: Non-cooperative facility location and covering games. In: Proc. 17th Int. Symp. Algorithms and Computation (ISAAC 2006) (2006)","DOI":"10.1007\/11940128_38"},{"key":"9014_CR14","doi-asserted-by":"crossref","unstructured":"Hoefer, M.: Non-cooperative tree creation. In: Proc. 31st Symp. Math. Foundations of Comp. Sci. (MFCS), pp.\u00a0517\u2013527 (2006)","DOI":"10.1007\/11821069_45"},{"key":"9014_CR15","doi-asserted-by":"crossref","unstructured":"Hoefer, M., Krysta, P.: Geometric network design with selfish agents. In: Proc. 11th Conf. on Comp. and Comb. (COCOON), Lecture Notes in Computer Science, vol.\u00a03595, pp.\u00a0167\u2013178 (2005)","DOI":"10.1007\/11533719_19"},{"key":"9014_CR16","volume-title":"Group Formation in Economics; Networks, Clubs and Coalitions","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. Cambridge University Press, Cambridge (2004). Chap.\u00a01"},{"key":"9014_CR17","doi-asserted-by":"crossref","unstructured":"Koutsoupias, E., Papadimitriou, C.: Worst-case equilibria. In: Proc. 16th Ann. Symp. Theoretical Aspects Comp. Sci. (STACS), pp.\u00a0404\u2013413 (1999)","DOI":"10.1007\/3-540-49116-3_38"},{"key":"9014_CR18","unstructured":"Robins, G., Zelikovsky, A.: Improved Steiner tree approximation in graphs. In: Proc. 10th Ann. ACM-SIAM Symp. Discrete Algorithms (SODA), pp.\u00a0770\u2013779 (2000)"},{"issue":"2","key":"9014_CR19","first-page":"236","volume":"49","author":"T. Roughgarden","year":"2002","unstructured":"Roughgarden, T., Tardos, \u00c9.: How bad is selfish routing?. J.\u00a0ACM 49(2), 236\u2013259 (2002)","journal-title":"J.\u00a0ACM"},{"issue":"4","key":"9014_CR20","doi-asserted-by":"crossref","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. 29(4), 961\u2013976 (2004)","journal-title":"Math. Oper. Res."},{"key":"9014_CR21","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.\u00a0416 (2002)","DOI":"10.1109\/SFCS.2002.1181966"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-007-9014-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-007-9014-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-007-9014-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T09:44:59Z","timestamp":1559123099000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-007-9014-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,9,8]]},"references-count":21,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2009,1]]}},"alternative-id":["9014"],"URL":"https:\/\/doi.org\/10.1007\/s00453-007-9014-9","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,9,8]]}}}