{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:17:08Z","timestamp":1759637828426},"publisher-location":"Berlin, Heidelberg","reference-count":15,"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_6","type":"book-chapter","created":{"date-parts":[[2012,12,4]],"date-time":"2012-12-04T07:32:28Z","timestamp":1354606348000},"page":"72-85","source":"Crossref","is-referenced-by-count":9,"title":["Bounded-Distance Network Creation Games"],"prefix":"10.1007","author":[{"given":"Davide","family":"Bil\u00f2","sequence":"first","affiliation":[]},{"given":"Luciano","family":"Gual\u00e0","sequence":"additional","affiliation":[]},{"given":"Guido","family":"Proietti","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"6_CR1","unstructured":"http:\/\/www-mat.upc.es\/grup_de_grafs\/grafs\/taula_delta_d.html\/ Universitat Polit\u00e9cnica de Catalunya, Barcelona, Spain"},{"key":"6_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. of the 17th ACM-SIAM Symposium on Discrete Algorithms (SODA 2006), pp. 89\u201398. ACM Press (2006)","DOI":"10.1145\/1109557.1109568"},{"key":"6_CR3","doi-asserted-by":"crossref","unstructured":"Anshelevich, E., Dasgupta, A., Tardos, \u00c9., Wexler, T.: Near-optimal network design with selfish agents. In: Proc. of the 35th Annual ACM Symposium on Theory of Computing (STOC 2003), pp. 511\u2013520. ACM Press (2003)","DOI":"10.1145\/780615.780617"},{"key":"6_CR4","doi-asserted-by":"crossref","unstructured":"Alon, N., Demaine, E.D., Hajiaghayi, M., Leighton, T.: Basic network creation games. In: Proc. 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":"6_CR5","volume-title":"The probabilistic method","author":"N. Alon","year":"1992","unstructured":"Alon, N., Spencer, J.H.: The probabilistic method. John Wiley, New York (1992)"},{"key":"6_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1007\/978-3-540-79309-0_20","volume-title":"Algorithmic Game Theory","author":"N. Baumann","year":"2008","unstructured":"Baumann, N., Stiller, S.: The Price of Anarchy of a Network Creation Game with Exponential Payoff. In: Monien, B., Schroeder, U.-P. (eds.) SAGT 2008. LNCS, vol.\u00a04997, pp. 218\u2013229. Springer, Heidelberg (2008)"},{"key":"6_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 ACM Symposium on Principles of Distributed Computing (PODC 2007), pp. 292\u2013298. ACM Press (2007)","DOI":"10.1145\/1281100.1281142"},{"key":"6_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 Symposium on Parallelism in Algorithms and Architectures (SPAA 2011), pp. 207\u2013214. ACM Press (2011)","DOI":"10.1145\/1989493.1989523"},{"key":"6_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 Symposium on Principles of Distributed Computing (PODC 2003), pp. 347\u2013351. ACM Press (2003)","DOI":"10.1145\/872035.872088"},{"issue":"1","key":"6_CR10","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":"6_CR11","doi-asserted-by":"crossref","unstructured":"Jackson, M.O.: Social and Economic Networks. Princeton University Press (2010)","DOI":"10.2307\/j.ctvcm4gh1"},{"issue":"3","key":"6_CR12","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1137\/0137041","volume":"37","author":"O. Kariv","year":"1979","unstructured":"Kariv, O., Hakimi, S.L.: An algorithmic approach to network location problems. II: The p-medians. SIAM J. Applied Math.\u00a037(3), 539\u2013560 (1979)","journal-title":"SIAM J. Applied Math."},{"key":"6_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"404","DOI":"10.1007\/3-540-49116-3_38","volume-title":"STACS 1999","author":"E. Koutsoupias","year":"1999","unstructured":"Koutsoupias, E., Papadimitriou, C.H.: Worst-Case Equilibria. In: Meinel, C., Tison, S. (eds.) STACS 1999. LNCS, vol.\u00a01563, pp. 404\u2013413. Springer, Heidelberg (1999)"},{"key":"6_CR14","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 Symposium on Principles of Distributed Computing (PODC 2008), pp. 165\u2013174. ACM Press (2008)","DOI":"10.1145\/1400751.1400774"},{"key":"6_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)"}],"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_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,2,2]],"date-time":"2022-02-02T05:44:13Z","timestamp":1643780653000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-35311-6_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642353109","9783642353116"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-35311-6_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}