{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T16:30:45Z","timestamp":1778344245161,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642353109","type":"print"},{"value":"9783642353116","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-35311-6_11","type":"book-chapter","created":{"date-parts":[[2012,12,4]],"date-time":"2012-12-04T02:32:28Z","timestamp":1354588348000},"page":"142-155","source":"Crossref","is-referenced-by-count":21,"title":["Greedy Selfish Network Creation"],"prefix":"10.1007","author":[{"given":"Pascal","family":"Lenzner","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"11_CR1","first-page":"89","volume-title":"Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithm, SODA 2006","author":"S. Albers","year":"2006","unstructured":"Albers, S., Eilts, S., Even-Dar, E., Mansour, Y., Roditty, L.: On nash equilibria for a network creation game. In: Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithm, SODA 2006, pp. 89\u201398. ACM, New York (2006)"},{"key":"11_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1007\/978-3-642-17572-5_2","volume-title":"Internet and Network Economics","author":"S. Albers","year":"2010","unstructured":"Albers, S., Lenzner, P.: On Approximate Nash Equilibria in Network Design. In: Saberi, A. (ed.) WINE 2010. LNCS, vol.\u00a06484, pp. 14\u201325. Springer, Heidelberg (2010)"},{"key":"11_CR3","first-page":"106","volume-title":"Proceedings of the 22nd ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2010","author":"N. Alon","year":"2010","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, New York (2010)"},{"issue":"3","key":"11_CR4","doi-asserted-by":"publisher","first-page":"544","DOI":"10.1137\/S0097539702416402","volume":"33","author":"V. Arya","year":"2004","unstructured":"Arya, V., Garg, N., Khandekar, R., Meyerson, A., Munagala, K., Pandit, V.: Local search heuristics for k-median and facility location problems. SIAM J. Comput.\u00a033(3), 544\u2013562 (2004)","journal-title":"SIAM J. Comput."},{"key":"11_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1007\/978-3-642-33996-7_7","volume-title":"Algorithmic Game Theory","author":"A. Cord-Landwehr","year":"2012","unstructured":"Cord-Landwehr, A., H\u00fcllmann, M., Kling, P., Setzer, A.: Basic Network Creation Games with Communication Interests. In: Serna, M. (ed.) SAGT 2012. LNCS, vol.\u00a07615, pp. 72\u201383. Springer, Heidelberg (2012)"},{"issue":"2","key":"11_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1980522.1980524","volume":"8","author":"E.D. Demaine","year":"2009","unstructured":"Demaine, E.D., Hajiaghayi, M., Mahini, H., Zadimoghaddam, M.: The price of anarchy in cooperative network creation games. SIGecom Exch.\u00a08(2), 2:1\u20132:20 (2009)","journal-title":"SIGecom Exch."},{"issue":"2","key":"11_CR7","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1145\/2151171.2151176","volume":"8","author":"E.D. Demaine","year":"2012","unstructured":"Demaine, E.D., Hajiaghayi, M.T., Mahini, H., Zadimoghaddam, M.: The price of anarchy in network creation games. ACM Trans. on Algorithms\u00a08(2), 13 (2012)","journal-title":"ACM Trans. on Algorithms"},{"key":"11_CR8","first-page":"207","volume-title":"Proceedings of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2011","author":"S. Ehsani","year":"2011","unstructured":"Ehsani, S., Fazli, M., Mehrabian, A., Sadeghian Sadeghabad, S., Safari, M., Saghafian, M., ShokatFadaee, S.: On a bounded budget network creation game. In: Proceedings of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2011, pp. 207\u2013214. ACM, New York (2011)"},{"key":"11_CR9","first-page":"347","volume-title":"Proc. of the 22nd Annual Symp. on Principles of Distributed Computing, PODC 2003","author":"A. Fabrikant","year":"2003","unstructured":"Fabrikant, A., Luthra, A., Maneva, E., Papadimitriou, C.H., Shenker, S.: On a network creation game. In: Proc. of the 22nd Annual Symp. on Principles of Distributed Computing, PODC 2003, pp. 347\u2013351. ACM, New York (2003)"},{"key":"11_CR10","doi-asserted-by":"crossref","unstructured":"Guly\u00e1s, A., K\u00f5r\u00f6si, A., Szab\u00f3, D., Bicz\u00f3k, G.: On greedy network formation. In: Proceedings of ACM SIGMETRICS Performance W-PIN (2012)","DOI":"10.1145\/2381056.2381069"},{"issue":"3","key":"11_CR11","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. on Appl. Math.\u00a037(3), 539\u2013560 (1979)","journal-title":"SIAM J. on Appl. Math."},{"key":"11_CR12","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":"11_CR13","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":"11_CR14","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.: 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)"},{"issue":"1","key":"11_CR15","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1073\/pnas.36.1.48","volume":"36","author":"J.F. Nash","year":"1950","unstructured":"Nash, J.F.: Equilibrium points in n-person games. PNAS\u00a036(1), 48\u201349 (1950)","journal-title":"PNAS"},{"key":"11_CR16","unstructured":"Vazirani, V.V.: Approximation algorithms. Springer (2001)"}],"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_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,9]],"date-time":"2019-05-09T09:49:08Z","timestamp":1557395348000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-35311-6_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642353109","9783642353116"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-35311-6_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012]]}}}