{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:34:13Z","timestamp":1759638853770},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319096193"},{"type":"electronic","value":"9783319096209"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-09620-9_17","type":"book-chapter","created":{"date-parts":[[2014,7,15]],"date-time":"2014-07-15T22:07:37Z","timestamp":1405462057000},"page":"210-223","source":"Crossref","is-referenced-by-count":9,"title":["Network Creation Games with Traceroute-Based Strategies"],"prefix":"10.1007","author":[{"given":"Davide","family":"Bil\u00f2","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luciano","family":"Gual\u00e0","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefano","family":"Leucci","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guido","family":"Proietti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"17_CR1","doi-asserted-by":"crossref","unstructured":"Alon, N., Demaine, E.D., Hajiaghayi, M., Leighton, T.: Basic network creation games. In: Proc. of the 22nd ACM Symp. on Parallelism in Algorithms and Architectures (SPAA 2010), pp. 106\u2013113. ACM Press (2010)","DOI":"10.1145\/1810479.1810502"},{"key":"17_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1007\/978-3-642-22212-2_24","volume-title":"Structural Information and Communication Complexity","author":"E. Bampas","year":"2011","unstructured":"Bampas, E., Bil\u00f2, D., Drovandi, G., Gual\u00e0, L., Klasing, R., Proietti, G.: Network verification via routing table queries. In: Kosowski, A., Yamashita, M. (eds.) SIROCCO 2011. LNCS, vol.\u00a06796, pp. 270\u2013281. Springer, Heidelberg (2011)"},{"issue":"12","key":"17_CR3","doi-asserted-by":"publisher","first-page":"2168","DOI":"10.1109\/JSAC.2006.884015","volume":"24","author":"Z. Beerliova","year":"2006","unstructured":"Beerliova, Z., Eberhard, F., Erlebach, T., Hall, A., Hoffman, M., Mihal\u00e1k, M., Ram, S.: Network discovery and verification. IEEE Journal on Selected Areas in Communications\u00a024(12), 2168\u20132181 (2006)","journal-title":"IEEE Journal on Selected Areas in Communications"},{"key":"17_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"392","DOI":"10.1007\/978-3-642-35311-6_29","volume-title":"Internet and Network Economics","author":"D. Bil\u00f2","year":"2012","unstructured":"Bil\u00f2, D., Gual\u00e0, L., Leucci, S., Proietti, G.: The max-distance network creation game on general host graphs. In: Goldberg, P.W. (ed.) WINE 2012. LNCS, vol.\u00a07695, pp. 392\u2013405. Springer, Heidelberg (2012)"},{"key":"17_CR5","doi-asserted-by":"crossref","unstructured":"Bil\u00f2, D., Gual\u00e0, L., Leucci, S., Proietti, G.: Locality-based network creation games. In: Proc. of the 26th ACM Symp. on Parallelism in Algorithms and Architectures (SPAA 2014), pp. 277\u2013286. ACM Press (2014)","DOI":"10.1145\/2612669.2612680"},{"key":"17_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1007\/978-3-642-35311-6_6","volume-title":"Internet and Network Economics","author":"D. Bil\u00f2","year":"2012","unstructured":"Bil\u00f2, D., Gual\u00e0, L., Proietti, G.: Bounded-distance network creation games. In: Goldberg, P.W. (ed.) WINE 2012. LNCS, vol.\u00a07695, pp. 72\u201385. Springer, Heidelberg (2012)"},{"key":"17_CR7","doi-asserted-by":"crossref","unstructured":"Demaine, E.D., Hajiaghayi, M., Mahini, H., Zadimoghaddam, M.: The price of anarchy in network creation games. In: Proc. of the 36th Annual ACM Symp. on Principles of Distributed Computing (PODC 2007), pp. 292\u2013298. ACM Press (2007)","DOI":"10.1145\/1281100.1281142"},{"key":"17_CR8","doi-asserted-by":"crossref","unstructured":"Ehsani, S., Fazli, M., Mehrabian, A., Sadeghabad, S.S., Saghafian, M., Shokatfadaee, S., Safari, M.: On a bounded budget network creation game. In: Proc. of the 23rd ACM Symp. on Parallelism in Algorithms and Architectures (SPAA 2011), pp. 207\u2013214. ACM Press (2011)","DOI":"10.1145\/1989493.1989523"},{"key":"17_CR9","doi-asserted-by":"crossref","unstructured":"Fabrikant, A., Luthra, A., Maneva, E., Papadimitriou, C.H., Shenker, S.: On a network creation game. In: Proc. of the 22nd Symp. on Principles of Distributed Computing (PODC 2003), pp. 347\u2013351. ACM Press (2003)","DOI":"10.1145\/872035.872088"},{"key":"17_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1007\/978-3-319-03536-9_17","volume-title":"Algorithms and Models for the Web Graph","author":"R. Graham","year":"2013","unstructured":"Graham, R., Hamilton, L., Levavi, A., Loh, P.-S.: Anarchy is free in network creation. In: Bonato, A., Mitzenmacher, M., Pra\u0142at, P. (eds.) WAW 2013. LNCS, vol.\u00a08305, pp. 220\u2013231. Springer, Heidelberg (2013)"},{"key":"17_CR11","doi-asserted-by":"crossref","unstructured":"Kawald, B., Lenzner, P.: On dynamics in selfish network creation. In: Proc. of the 25th ACM Symp. on Parallelism in Algorithms and Architectures (SPAA 2013), pp. 83\u201392. ACM Press (2013)","DOI":"10.1145\/2486159.2486185"},{"key":"17_CR12","doi-asserted-by":"crossref","unstructured":"Laoutaris, N., Poplawski, L.J., Rajaraman, R., Sundaram, R., Teng, S.-H.: Bounded budget connection (BBC) games or how to make friends and influence people, on a budget. In: Proc. of the 27th ACM Symp. on Principles of Distributed Computing (PODC 2008), pp. 165\u2013174. ACM Press (2008)","DOI":"10.1145\/1400751.1400774"},{"key":"17_CR13","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.\u00a07695, pp. 142\u2013155. Springer, Heidelberg (2012)"},{"key":"17_CR14","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.\u00a08305, pp. 118\u2013129. Springer, Heidelberg (2013)"},{"key":"17_CR15","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.\u00a06386, pp. 276\u2013287. Springer, Heidelberg (2010)"},{"key":"17_CR16","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.\u00a07464, pp. 693\u2013704. Springer, Heidelberg (2012)"}],"container-title":["Lecture Notes in Computer Science","Structural Information and Communication Complexity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-09620-9_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T05:37:47Z","timestamp":1558935467000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-09620-9_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319096193","9783319096209"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-09620-9_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}