{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,12]],"date-time":"2025-11-12T03:20:20Z","timestamp":1762917620484,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662480533"},{"type":"electronic","value":"9783662480540"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-662-48054-0_21","type":"book-chapter","created":{"date-parts":[[2015,8,10]],"date-time":"2015-08-10T11:57:29Z","timestamp":1439207849000},"page":"248-260","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Network Creation Games: Think Global \u2013 Act Local"],"prefix":"10.1007","author":[{"given":"Andreas","family":"Cord-Landwehr","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pascal","family":"Lenzner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,8,11]]},"reference":[{"issue":"1","key":"21_CR1","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1145\/2560767","volume":"2","author":"S Albers","year":"2014","unstructured":"Albers, S., Eilts, S., Even-Dar, E., Mansour, Y., Roditty, L.: On nash equilibria for a network creation game. ACM Trans. Econ. Comput. 2(1), 2 (2014)","journal-title":"ACM Trans. Econ. Comput."},{"issue":"4","key":"21_CR2","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, E., Wexler, T., Roughgarden, T.: The price of stability for network design with fair cost allocation. SIAM J. Comput. 38(4), 1602\u20131623 (2008)","journal-title":"SIAM J. Comput."},{"issue":"5","key":"21_CR3","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 noncooperative model of network formation. Econometrica 68(5), 1181\u20131229 (2000)","journal-title":"Econometrica"},{"key":"21_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"210","DOI":"10.1007\/978-3-319-09620-9_17","volume-title":"Structural Information and Communication Complexity","author":"D Bil\u00f2","year":"2014","unstructured":"Bil\u00f2, D., Gual\u00e0, L., Leucci, S., Proietti, G.: Network creation games with traceroute-based strategies. In: Halld\u00f3rsson, M.M. (ed.) SIROCCO 2014. LNCS, vol. 8576, pp. 210\u2013223. Springer, Heidelberg (2014)"},{"key":"21_CR5","doi-asserted-by":"crossref","unstructured":"Bil\u00f2, D., Gual\u00e0, L., Leucci, S., Proietti, G.: Locality-based network creation games. In: SPAA 2014, pp. 277\u2013286. ACM, New York (2014)","DOI":"10.1145\/2612669.2612680"},{"key":"21_CR6","doi-asserted-by":"crossref","unstructured":"Corbo, J., Parkes, D.: The price of selfish behavior in bilateral network formation. In: PODC 2005 Proceedings, pp. 99\u2013107. ACM, New York (2005)","DOI":"10.1145\/1073814.1073833"},{"key":"21_CR7","doi-asserted-by":"crossref","unstructured":"Cord-Landwehr, A., Lenzner, P.: Network creation games: Think global - act local. CoRR, abs\/1506.02616 (2015)","DOI":"10.1007\/978-3-662-48054-0_21"},{"issue":"2","key":"21_CR8","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1145\/2151171.2151176","volume":"8","author":"ED Demaine","year":"2012","unstructured":"Demaine, E.D., Hajiaghayi, M.T., Mahini, H., Zadimoghaddam, M.: The price of anarchy in network creation games. ACM Trans. Algorithms 8(2), 13 (2012)","journal-title":"ACM Trans. Algorithms"},{"key":"21_CR9","doi-asserted-by":"crossref","unstructured":"Ehsani, S., Fazli, M., Mehrabian, A., Sadeghabad, S.S., Safari, M., Saghafian, M., ShokatFadaee, S.: On a bounded budget network creation game. In: SPAA 2011, pp. 207\u2013214. ACM (2011)","DOI":"10.1145\/1989493.1989523"},{"key":"21_CR10","doi-asserted-by":"crossref","unstructured":"Fabrikant, A., Luthra, A., Maneva, E., Papadimitriou, C.H., Shenker, S.: On a network creation game. In: PODC 2003 Proceedings, pp. 347\u2013351. ACM (2003)","DOI":"10.1145\/872035.872088"},{"key":"21_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/978-3-642-22012-8_8","volume-title":"Automata, Languages and Programming","author":"M Hoefer","year":"2011","unstructured":"Hoefer, M.: Local matching dynamics in social networks. In: Aceto, L., Henzinger, M., Sgall, J. (eds.) ICALP 2011, Part II. LNCS, vol. 6756, pp. 113\u2013124. Springer, Heidelberg (2011)"},{"issue":"1","key":"21_CR12","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1006\/jeth.1996.0108","volume":"71","author":"MO Jackson","year":"1996","unstructured":"Jackson, M.O., Wolinsky, A.: A strategic model of social and economic networks. J. Econ. Theory 71(1), 44\u201374 (1996)","journal-title":"J. Econ. Theory"},{"key":"21_CR13","doi-asserted-by":"crossref","unstructured":"Kawald, B., Lenzner, P.: On dynamics in selfish network creation. In: Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures, pp. 83\u201392. ACM (2013)","DOI":"10.1145\/2486159.2486185"},{"key":"21_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"404","DOI":"10.1007\/3-540-49116-3_38","volume-title":"STACS 99","author":"E Koutsoupias","year":"1999","unstructured":"Koutsoupias, E., Papadimitriou, C.: Worst-case equilibria. In: Meinel, C., Tison, S. (eds.) STACS 1999. LNCS, vol. 1563, p. 404. Springer, Heidelberg (1999)"},{"key":"21_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1007\/978-3-642-24829-0_23","volume-title":"Algorithmic Game Theory","author":"P Lenzner","year":"2011","unstructured":"Lenzner, P.: On dynamics in basic network creation games. In: Persiano, G. (ed.) SAGT 2011. LNCS, vol. 6982, pp. 254\u2013265. Springer, Heidelberg (2011)"},{"key":"21_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1007\/978-3-642-35311-6_11","volume-title":"Internet and Network Economics","author":"P Lenzner","year":"2012","unstructured":"Lenzner, P.: Greedy selfish network creation. In: Goldberg, P.W. (ed.) WINE 2012. LNCS, vol. 7695, pp. 142\u2013155. Springer, Heidelberg (2012)"},{"key":"21_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1007\/978-3-319-03536-9_10","volume-title":"Algorithms and Models for the Web Graph","author":"A Mamageishvili","year":"2013","unstructured":"Mamageishvili, A., Mihal\u00e1k, M., M\u00fcller, D.: Tree nash equilibria in the network creation game. In: Bonato, A., Mitzenmacher, M., Pra\u0142at, P. (eds.) WAW 2013. LNCS, vol. 8305, pp. 118\u2013129. Springer, Heidelberg (2013)"},{"key":"21_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1007\/978-3-642-16170-4_24","volume-title":"Algorithmic Game Theory","author":"M Mihal\u00e1k","year":"2010","unstructured":"Mihal\u00e1k, M., Schlegel, J.C.: The price of anarchy in network creation games is (Mostly) constant. In: Kontogiannis, S., Koutsoupias, E., Spirakis, P.G. (eds.) SAGT 2010. LNCS, vol. 6386, pp. 276\u2013287. Springer, Heidelberg (2010)"},{"key":"21_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"693","DOI":"10.1007\/978-3-642-32589-2_60","volume-title":"Mathematical Foundations of Computer Science 2012","author":"M Mihal\u00e1k","year":"2012","unstructured":"Mihal\u00e1k, M., Schlegel, J.C.: Asymmetric swap-equilibrium: a unifying equilibrium concept for network creation games. In: Rovan, B., Sassone, V., Widmayer, P. (eds.) MFCS 2012. LNCS, vol. 7464, pp. 693\u2013704. Springer, Heidelberg (2012)"},{"issue":"1","key":"21_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.S.: Potential games. Games Econ. Behav. 14(1), 124\u2013143 (1996)","journal-title":"Games Econ. Behav."},{"key":"21_CR21","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511800481","volume-title":"Algorithmic Game Theory","author":"N Nisan","year":"2007","unstructured":"Nisan, N., Roughgarden, T., Tardos, E., Vazirani, V.V.: Algorithmic Game Theory. Cambridge University Press, New York (2007)"},{"key":"21_CR22","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511921735","volume-title":"The Design of Approximation Algorithms","author":"DP Williamson","year":"2011","unstructured":"Williamson, D.P., Shmoys, D.B.: The Design of Approximation Algorithms. Cambridge University Press, New York (2011)"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2015"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-48054-0_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,21]],"date-time":"2023-02-21T06:15:22Z","timestamp":1676960122000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-662-48054-0_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662480533","9783662480540"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-48054-0_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"11 August 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}