{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T14:28:47Z","timestamp":1726410527091},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642353109"},{"type":"electronic","value":"9783642353116"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-35311-6_29","type":"book-chapter","created":{"date-parts":[[2012,12,4]],"date-time":"2012-12-04T07:32:28Z","timestamp":1354606348000},"page":"392-405","source":"Crossref","is-referenced-by-count":6,"title":["The Max-Distance Network Creation Game on General Host Graphs"],"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":"29_CR1","doi-asserted-by":"crossref","unstructured":"Alon, N., Demaine, E.D., Hajiaghayi, M., Leighton, T.: Basic network creation games. In: Proceedings of the 22nd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2010), pp. 106\u2013113. ACM Press (2010)","DOI":"10.1145\/1810479.1810502"},{"key":"29_CR2","series-title":"LNCS","first-page":"72","volume-title":"WINE 2012","author":"D. Bil\u00f3","year":"2012","unstructured":"Bil\u00f3, D., Gual\u00e1, L., Proietti, G.: Bounded-Distance Network Creation Games. In: Goldberg, P.W., Guo, M. (eds.) WINE 2012. LNCS, vol.\u00a07695, pp. 72\u201385. Springer, Heidelberg (2012)"},{"key":"29_CR3","doi-asserted-by":"crossref","unstructured":"Demaine, E.D., Hajiaghayi, M., Mahini, H., Zadimoghaddam, M.: The price of anarchy in network creation games. In: Proceedings of the 36th Annual ACM Symposium on Principles of Distributed Computing (PODC 2007), pp. 292\u2013298. ACM Press (2007)","DOI":"10.1145\/1281100.1281142"},{"key":"29_CR4","unstructured":"Demaine, E.D., Hajiaghayi, M., Mahini, H., Zadimoghaddam, M.: The price of anarchy in cooperative network creation games. In: Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science (STACS 2009). Leibniz International Proceedings in Informatics, vol.\u00a03, pp. 301\u2013312 (2009)"},{"key":"29_CR5","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: Proceedings of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2011). ACM Press (2011) (in press)","DOI":"10.1145\/1989493.1989523"},{"key":"29_CR6","doi-asserted-by":"crossref","unstructured":"Fabrikant, A., Luthra, A., Maneva, E., Papadimitriou, C.H., Shenker, S.: On a network creation game. In: Proceedings of the 22nd Symposium on Principles of Distributed Computing (PODC 2003), pp. 347\u2013351. ACM Press (2003)","DOI":"10.1145\/872035.872088"},{"issue":"1","key":"29_CR7","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1006\/jeth.1996.0108","volume":"71","author":"M.O. Jackson","year":"1996","unstructured":"Jackson, M.O., Wolinsky, A.: A strategic model of social and economic networks. Journal of Economic Theory\u00a071(1), 44\u201374 (1996)","journal-title":"Journal of Economic Theory"},{"key":"29_CR8","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: Proceedings of the 27th ACM Symposium on Principles of Distributed Computing (PODC 2008), pp. 165\u2013174. ACM Press (2008)","DOI":"10.1145\/1400751.1400774"},{"key":"29_CR9","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":"29_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/3-540-17218-1_61","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"A.A. Schoone","year":"1987","unstructured":"Schoone, A.A., Bodlaender, H.L., van Leeuwen, J.: Improved Diameter Bounds for Altered Graphs. In: Tinhofer, G., Schmidt, G. (eds.) WG 1986. LNCS, vol.\u00a0246, pp. 227\u2013236. Springer, Heidelberg (1987)"},{"key":"29_CR11","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.\u00a06982, pp. 254\u2013265. Springer, Heidelberg (2011)"},{"key":"29_CR12","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","Internet and Network Economics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-35311-6_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,9]],"date-time":"2019-05-09T13:49:49Z","timestamp":1557409789000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-35311-6_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642353109","9783642353116"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-35311-6_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}