{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,12]],"date-time":"2025-11-12T03:33:56Z","timestamp":1762918436855,"version":"3.45.0"},"publisher-location":"Cham","reference-count":43,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031929342"},{"type":"electronic","value":"9783031929359"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-3-031-92935-9_2","type":"book-chapter","created":{"date-parts":[[2025,5,17]],"date-time":"2025-05-17T04:07:08Z","timestamp":1747454828000},"page":"18-34","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Network Creation Games with\u00a02-Neighborhood Maximization"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0000-9517-4609","authenticated-orcid":false,"given":"Merlin","family":"de la Haye","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3010-1019","authenticated-orcid":false,"given":"Pascal","family":"Lenzner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7776-3426","authenticated-orcid":false,"given":"Daniel","family":"Schmand","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0008-2589-3809","authenticated-orcid":false,"given":"Nicole","family":"Schr\u00f6der","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,5,18]]},"reference":[{"issue":"1","key":"2_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). https:\/\/doi.org\/10.1145\/2560767","journal-title":"ACM Trans. Econ. Comput."},{"key":"2_CR2","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1016\/J.TCS.2016.08.005","volume":"648","author":"C \u00c0lvarez","year":"2016","unstructured":"\u00c0lvarez, C., Blesa, M.J., Duch, A., Messegu\u00e9, A., Serna, M.: Celebrity games. Theoret. Comput. Sci. 648, 56\u201371 (2016). https:\/\/doi.org\/10.1016\/J.TCS.2016.08.005","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"2_CR3","doi-asserted-by":"publisher","first-page":"1030","DOI":"10.1137\/21M1466426","volume":"37","author":"C \u00c0lvarez","year":"2023","unstructured":"\u00c0lvarez, C., Buisan, A.M.: On the PoA conjecture: trees versus biconnected components. SIAM J. Discret. Math. 37(2), 1030\u20131052 (2023). https:\/\/doi.org\/10.1137\/21M1466426","journal-title":"SIAM J. Discret. Math."},{"key":"2_CR4","doi-asserted-by":"publisher","unstructured":"\u00c0lvarez, C., Messegu\u00e9, A.: On the price of anarchy for high-price links. In: WINE 2019, pp. 316\u2013329 (2019). https:\/\/doi.org\/10.1007\/978-3-030-35389-6_23","DOI":"10.1007\/978-3-030-35389-6_23"},{"issue":"2","key":"2_CR5","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/J.GEB.2008.03.005","volume":"65","author":"N Andelman","year":"2009","unstructured":"Andelman, N., Feldman, M., Mansour, Y.: Strong price of anarchy. Games Econom. Behav. 65(2), 289\u2013317 (2009). https:\/\/doi.org\/10.1016\/J.GEB.2008.03.005","journal-title":"Games Econom. Behav."},{"issue":"3","key":"2_CR6","doi-asserted-by":"publisher","first-page":"711","DOI":"10.1007\/S00224-014-9582-4","volume":"57","author":"E Anshelevich","year":"2015","unstructured":"Anshelevich, E., Bhardwaj, O., Usher, M.: Friend of my friend: network formation with two-hop benefit. Theory Comput. Syst. 57(3), 711\u2013752 (2015). https:\/\/doi.org\/10.1007\/S00224-014-9582-4","journal-title":"Theory Comput. Syst."},{"key":"2_CR7","unstructured":"Barab\u00e1si, A.L.: Network Science. Cambridge University Press (2016)"},{"key":"2_CR8","doi-asserted-by":"publisher","unstructured":"Baumann, N., Stiller, S.: The price of anarchy of a network creation game with exponential payoff. In: SAGT 2008, pp. 218\u2013229 (2008). https:\/\/doi.org\/10.1007\/978-3-540-79309-0_20","DOI":"10.1007\/978-3-540-79309-0_20"},{"key":"2_CR9","doi-asserted-by":"publisher","unstructured":"Bil\u00f2, D., et al.: Temporal network creation games. In: IJCAI 2023, pp. 2511\u20132519 (2023). https:\/\/doi.org\/10.24963\/IJCAI.2023\/279","DOI":"10.24963\/IJCAI.2023\/279"},{"key":"2_CR10","doi-asserted-by":"publisher","unstructured":"Bil\u00f2, D., et al.: Temporal network creation games: the impact of non-locality and terminals. CoRR abs\/2411.03973 (2024). https:\/\/doi.org\/10.48550\/ARXIV.2411.03973","DOI":"10.48550\/ARXIV.2411.03973"},{"key":"2_CR11","doi-asserted-by":"publisher","unstructured":"Bil\u00f2, D., Friedrich, T., Lenzner, P., Lowski, S., Melnichenko, A.: Selfish creation of social networks. In: AAAI 2021, pp. 5185\u20135193 (2021). https:\/\/doi.org\/10.1609\/AAAI.V35I6.16655","DOI":"10.1609\/AAAI.V35I6.16655"},{"issue":"1","key":"2_CR12","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1137\/20M1376662","volume":"38","author":"D Bil\u00f2","year":"2024","unstructured":"Bil\u00f2, D., Friedrich, T., Lenzner, P., Melnichenko, A.: Geometric network creation games. SIAM J. Discret. Math. 38(1), 277\u2013315 (2024). https:\/\/doi.org\/10.1137\/20M1376662","journal-title":"SIAM J. Discret. Math."},{"key":"2_CR13","doi-asserted-by":"publisher","unstructured":"Bil\u00f2, D., Gual\u00e0, L., Leucci, S., Proietti, G.: Locality-based network creation games. ACM Trans. Parallel Comput. 3(1), 1\u201326 (2016). https:\/\/doi.org\/10.1145\/2938426","DOI":"10.1145\/2938426"},{"issue":"2","key":"2_CR14","doi-asserted-by":"publisher","first-page":"35","DOI":"10.3390\/A14020035","volume":"14","author":"D Bil\u00f2","year":"2021","unstructured":"Bil\u00f2, D., Gual\u00e0, L., Leucci, S., Proietti, G.: Network creation games with traceroute-based strategies. Algorithms 14(2), 35 (2021). https:\/\/doi.org\/10.3390\/A14020035","journal-title":"Algorithms"},{"key":"2_CR15","doi-asserted-by":"publisher","unstructured":"Bil\u00f2, D., Gual\u00e0, L., Proietti, G.: Bounded-distance network creation games. ACM Trans. Econ. Comput. 3(3), 1\u201320 (2015). https:\/\/doi.org\/10.1145\/2770639","DOI":"10.1145\/2770639"},{"issue":"3","key":"2_CR16","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1007\/S00224-019-09945-9","volume":"64","author":"D Bil\u00f2","year":"2020","unstructured":"Bil\u00f2, D., Lenzner, P.: On the tree conjecture for the network creation game. Theory Comput. Syst. 64(3), 422\u2013443 (2020). https:\/\/doi.org\/10.1007\/S00224-019-09945-9","journal-title":"Theory Comput. Syst."},{"key":"2_CR17","unstructured":"Burt, R.S.: Structural Holes: The Social Structure of Competition. Harvard University Press (1995)"},{"key":"2_CR18","doi-asserted-by":"publisher","unstructured":"Chauhan, A., Lenzner, P., Melnichenko, A., Molitor, L.: Selfish network creation with non-uniform edge cost. In: SAGT 2017, pp. 160\u2013172 (2017). https:\/\/doi.org\/10.1007\/978-3-319-66700-3_13","DOI":"10.1007\/978-3-319-66700-3_13"},{"key":"2_CR19","doi-asserted-by":"publisher","unstructured":"Chauhan, A., Lenzner, P., Melnichenko, A., M\u00fcnn, M.: On selfish creation of robust networks. In: SAGT 2016, pp. 141\u2013152 (2016). https:\/\/doi.org\/10.1007\/978-3-662-53354-3_12","DOI":"10.1007\/978-3-662-53354-3_12"},{"key":"2_CR20","doi-asserted-by":"publisher","unstructured":"Corbo, J., Parkes, D.C.: The price of selfish behavior in bilateral network formation. In: PODC 2005, pp. 99\u2013107 (2005). https:\/\/doi.org\/10.1145\/1073814.1073833","DOI":"10.1145\/1073814.1073833"},{"key":"2_CR21","doi-asserted-by":"publisher","unstructured":"Cord-Landwehr, A., Lenzner, P.: Network creation games: think global - act local. In: MFCS 2015, pp. 248\u2013260 (2015). https:\/\/doi.org\/10.1007\/978-3-662-48054-0_21","DOI":"10.1007\/978-3-662-48054-0_21"},{"key":"2_CR22","doi-asserted-by":"publisher","unstructured":"Cord-Landwehr, A., M\u00e4cker, A., auf\u00a0der Heide, F.M.: Quality of service in network creation games. In: WINE 2014, pp. 423\u2013428 (2014). https:\/\/doi.org\/10.1007\/978-3-319-13129-0_34","DOI":"10.1007\/978-3-319-13129-0_34"},{"key":"2_CR23","doi-asserted-by":"publisher","unstructured":"Demaine, E.D., Hajiaghayi, M., Mahini, H., Zadimoghaddam, M.: The price of anarchy in network creation games. In: PODC 2007, pp. 292\u2013298 (2007). https:\/\/doi.org\/10.1145\/1281100.1281142","DOI":"10.1145\/1281100.1281142"},{"key":"2_CR24","doi-asserted-by":"publisher","unstructured":"Echzell, H., Friedrich, T., Lenzner, P., Melnichenko, A.: Flow-based network creation games. In: IJCAI 2020, pp. 139\u2013145 (2020). https:\/\/doi.org\/10.24963\/ijcai.2020\/20","DOI":"10.24963\/ijcai.2020\/20"},{"issue":"2","key":"2_CR25","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/s11036-005-4468-y","volume":"11","author":"SJ Eidenbenz","year":"2006","unstructured":"Eidenbenz, S.J., Kumar, V., Zust, S.: Equilibria in topology control games for Ad Hoc networks. Mob. Networks Appl. 11(2), 143\u2013159 (2006). https:\/\/doi.org\/10.1007\/s11036-005-4468-y","journal-title":"Mob. Networks Appl."},{"key":"2_CR26","doi-asserted-by":"publisher","unstructured":"Fabrikant, A., Luthra, A., Maneva, E., Papadimitriou, C., Shenker, S.: On a network creation game. In: PODC 2003, pp. 347\u2013351 (2003). https:\/\/doi.org\/10.1145\/872035.872088","DOI":"10.1145\/872035.872088"},{"key":"2_CR27","doi-asserted-by":"publisher","unstructured":"Friedrich, T., Gawendowicz, H., Lenzner, P., Melnichenko, A.: Social distancing network creation. In: ICALP 2022, pp. 1\u201321 (2022). https:\/\/doi.org\/10.4230\/LIPICS.ICALP.2022.62","DOI":"10.4230\/LIPICS.ICALP.2022.62"},{"key":"2_CR28","doi-asserted-by":"publisher","unstructured":"Friedrich, T., Gawendowicz, H., Lenzner, P., Zahn, A.: The impact of cooperation in bilateral network creation. In: PODC 2023, pp. 321\u2013331 (2023). https:\/\/doi.org\/10.1145\/3583668.3594588","DOI":"10.1145\/3583668.3594588"},{"key":"2_CR29","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Co. (1979)"},{"key":"2_CR30","doi-asserted-by":"publisher","unstructured":"Goyal, S., Jabbari, S., Kearns, M.J., Khanna, S., Morgenstern, J.: Strategic network formation with attack and immunization. In: WINE 2016, pp. 429\u2013443 (2016). https:\/\/doi.org\/10.1007\/978-3-662-54110-4_30","DOI":"10.1007\/978-3-662-54110-4_30"},{"issue":"2","key":"2_CR31","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1145\/2729978","volume":"12","author":"R Graham","year":"2016","unstructured":"Graham, R., Hamilton, L., Levavi, A., Loh, P.S.: Anarchy is free in network creation. ACM Trans. Algorithms (TALG) 12(2), 15 (2016). https:\/\/doi.org\/10.1145\/2729978","journal-title":"ACM Trans. Algorithms (TALG)"},{"key":"2_CR32","doi-asserted-by":"crossref","unstructured":"de\u00a0la Haye, M., Lenzner, P., Schmand, D., Schr\u00f6der, N.: Network creation games with 2-neighborhood maximization (2025). https:\/\/arxiv.org\/abs\/2502.06561. full version of this paper","DOI":"10.1007\/978-3-031-92935-9_2"},{"key":"2_CR33","doi-asserted-by":"publisher","unstructured":"Jackson, M.O., Wolinsky, A.: A strategic model of social and economic networks. In: Dutta, B., Jackson, M.O. (eds.) Networks and Groups: Models of Strategic Formation, pp. 23\u201349. Springer Berlin Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-24790-6_3","DOI":"10.1007\/978-3-540-24790-6_3"},{"key":"2_CR34","doi-asserted-by":"publisher","unstructured":"Kleinberg, J.M., Suri, S., Tardos, \u00c9., Wexler, T.: Strategic network formation with structural holes. In: EC 2008, pp. 284\u2013293 (2008). https:\/\/doi.org\/10.1145\/1386790.1386835","DOI":"10.1145\/1386790.1386835"},{"key":"2_CR35","doi-asserted-by":"publisher","unstructured":"Lenzner, P.: Greedy selfish network creation. In: WINE 2012, pp. 142\u2013155 (2012). https:\/\/doi.org\/10.1007\/978-3-642-35311-6_11","DOI":"10.1007\/978-3-642-35311-6_11"},{"key":"2_CR36","doi-asserted-by":"publisher","unstructured":"Mamageishvili, A., Mihal\u00e1k, M., M\u00fcller, D.: Tree Nash equilibria in the network creation game. Internet Math. 11(4\u20135), 472\u2013486 (2015). https:\/\/doi.org\/10.1080\/15427951.2015.1016248","DOI":"10.1080\/15427951.2015.1016248"},{"key":"2_CR37","doi-asserted-by":"publisher","unstructured":"Meirom, E.A., Mannor, S., Orda, A.: Network formation games with heterogeneous players and the internet structure. In: EC 2014, pp. 735\u2013752 (2014). https:\/\/doi.org\/10.1145\/2600057.2602862","DOI":"10.1145\/2600057.2602862"},{"key":"2_CR38","doi-asserted-by":"publisher","unstructured":"Meirom, E.A., Mannor, S., Orda, A.: Formation games of reliable networks. In: INFOCOM 2015, pp. 1760\u20131768 (2015). https:\/\/doi.org\/10.1109\/INFOCOM.2015.7218557","DOI":"10.1109\/INFOCOM.2015.7218557"},{"issue":"1","key":"2_CR39","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/s00224-013-9459-y","volume":"53","author":"M Mihal\u00e1k","year":"2013","unstructured":"Mihal\u00e1k, M., Schlegel, J.C.: The price of anarchy in network creation games is (mostly) constant. TCS 53(1), 53\u201372 (2013). https:\/\/doi.org\/10.1007\/s00224-013-9459-y","journal-title":"TCS"},{"issue":"1","key":"2_CR40","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). https:\/\/doi.org\/10.1006\/game.1996.0044","journal-title":"Games Econ. Behav."},{"key":"2_CR41","doi-asserted-by":"publisher","unstructured":"Moscibroda, T., Schmid, S., Wattenhofer, R.: On the topologies formed by selfish peers. In: PODC 2006, pp. 133\u2013142 (2006). https:\/\/doi.org\/10.1145\/1146381.1146403","DOI":"10.1145\/1146381.1146403"},{"key":"2_CR42","doi-asserted-by":"publisher","unstructured":"Papadimitriou, C.H.: Algorithms, games, and the internet. In: STOC 2001, pp. 749\u2013753 (2001). https:\/\/doi.org\/10.1145\/380752.380883","DOI":"10.1145\/380752.380883"},{"key":"2_CR43","doi-asserted-by":"publisher","unstructured":"Rossi, R.A., Ahmed, N.K.: The network data repository with interactive graph analytics and visualization. In: AAAI 2015 (2015). https:\/\/doi.org\/10.1609\/aaai.v29i1.9277","DOI":"10.1609\/aaai.v29i1.9277"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Complexity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-92935-9_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,12]],"date-time":"2025-11-12T00:37:19Z","timestamp":1762907839000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-92935-9_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031929342","9783031929359"],"references-count":43,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-92935-9_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"18 May 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CIAC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithms and Complexity","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Rome","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 June 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 June 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ciac2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/easyconferences.eu\/ciac2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}