{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,13]],"date-time":"2026-05-13T17:12:04Z","timestamp":1778692324476,"version":"3.51.4"},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T00:00:00Z","timestamp":1778284800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T00:00:00Z","timestamp":1778284800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"crossref","award":["DFG 442003138"],"award-info":[{"award-number":["DFG 442003138"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"crossref","award":["DFG 442003138"],"award-info":[{"award-number":["DFG 442003138"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"crossref","award":["DFG 442003138"],"award-info":[{"award-number":["DFG 442003138"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"crossref","award":["DFG 442003138"],"award-info":[{"award-number":["DFG 442003138"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"crossref","award":["DFG 442003138"],"award-info":[{"award-number":["DFG 442003138"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"crossref","award":["DFG 442003138"],"award-info":[{"award-number":["DFG 442003138"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"crossref","award":["DFG 442003138"],"award-info":[{"award-number":["DFG 442003138"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Auton Agent Multi-Agent Syst"],"published-print":{"date-parts":[[2026,6]]},"DOI":"10.1007\/s10458-026-09752-w","type":"journal-article","created":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T05:21:19Z","timestamp":1778304079000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Temporal network creation games: the impact of non-locality and terminals"],"prefix":"10.1007","volume":"40","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3169-4300","authenticated-orcid":false,"given":"Davide","family":"Bil\u00f2","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4578-1245","authenticated-orcid":false,"given":"Sarel","family":"Cohen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0076-6308","authenticated-orcid":false,"given":"Tobias","family":"Friedrich","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8394-4469","authenticated-orcid":false,"given":"Hans","family":"Gawendowicz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5406-7441","authenticated-orcid":false,"given":"Nicolas","family":"Klodt","sequence":"additional","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-0003-2514-8004","authenticated-orcid":false,"given":"George","family":"Skretas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,5,9]]},"reference":[{"key":"9752_CR1","doi-asserted-by":"publisher","unstructured":"Bil\u00f2, D., Cohen, S., Friedrich, T., Gawendowicz, H., Klodt, N., Lenzner, P., & Skretas, G. (2023). Temporal network creation games. In IJCAI 2023, pp. 2511\u20132519. https:\/\/doi.org\/10.24963\/IJCAI.2023\/279","DOI":"10.24963\/IJCAI.2023\/279"},{"key":"9752_CR2","doi-asserted-by":"publisher","unstructured":"Backstrom, L., Huttenlocher, D., Kleinberg, J., & Lan, X. (2006). Group formation in large social networks: membership, growth, and evolution. In: KDD 2006, pp. 44\u201354. https:\/\/doi.org\/10.1145\/1150402.1150412","DOI":"10.1145\/1150402.1150412"},{"key":"9752_CR3","doi-asserted-by":"publisher","unstructured":"Doerr, B., Fouz, M., & Friedrich, T. (2012). Why rumors spread so quickly in social networks. Communications of The ACM - CACM. 55, 70\u201375. https:\/\/doi.org\/10.1145\/2184319.2184338","DOI":"10.1145\/2184319.2184338"},{"key":"9752_CR4","doi-asserted-by":"publisher","unstructured":"Newman, M.E.J., Watts, D.J., & Strogatz, S.H. (2002). Random graph models of social networks. In Proceedings of the National Academy of Sciences,99(suppl_1), 2566\u20132572. https:\/\/doi.org\/10.1073\/pnas.012582999","DOI":"10.1073\/pnas.012582999"},{"issue":"3","key":"9752_CR5","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.82.036106","volume":"82","author":"D Krioukov","year":"2010","unstructured":"Krioukov, D., Papadopoulos, F., Kitsak, M., Vahdat, A., & Bogun\u00e1, M. (2010). Hyperbolic geometry of complex networks. Physical Review E., 82(3), Article 036106.","journal-title":"Physical Review E."},{"issue":"7417","key":"9752_CR6","doi-asserted-by":"publisher","first-page":"537","DOI":"10.1038\/nature11459","volume":"489","author":"F Papadopoulos","year":"2012","unstructured":"Papadopoulos, F., Kitsak, M., Serrano, M. \u00c1., Bogun\u00e1, M., & Krioukov, D. (2012). Popularity versus similarity in growing networks. Nature., 489(7417), 537\u2013540.","journal-title":"Nature."},{"key":"9752_CR7","doi-asserted-by":"publisher","unstructured":"Papadimitriou, C.H. (2001). Algorithms, games, and the internet. In STOC 2001, pp. 749\u2013753. https:\/\/doi.org\/10.1145\/380752.380883","DOI":"10.1145\/380752.380883"},{"key":"9752_CR8","doi-asserted-by":"crossref","unstructured":"Fabrikant, A., Luthra, A., Maneva, E.N., Papadimitriou, C.H., & Shenker, S. (2003). On a network creation game. In PODC 2003, pp. 347\u2013351. ACM.","DOI":"10.1145\/872035.872088"},{"key":"9752_CR9","doi-asserted-by":"publisher","unstructured":"Meirom, E.A., Mannor, S., & Orda, A. (2014). Network formation games with heterogeneous players and the internet structure. In EC 2014, pp. 735\u2013752. https:\/\/doi.org\/10.1145\/2600057.2602862","DOI":"10.1145\/2600057.2602862"},{"key":"9752_CR10","doi-asserted-by":"publisher","unstructured":"Cord-Landwehr, A., M\u00e4cker, A., & Heide, F.M. (2014). Quality of service in network creation games. In WINE 2014, pp. 423\u2013428. https:\/\/doi.org\/10.1007\/978-3-319-13129-0_34","DOI":"10.1007\/978-3-319-13129-0_34"},{"key":"9752_CR11","doi-asserted-by":"publisher","unstructured":"Chauhan, A., Lenzner, P., Melnichenko, A., & Molitor, L. (2017). Selfish network creation with non-uniform edge cost. In SAGT 2017, pp. 160\u2013172. https:\/\/doi.org\/10.1007\/978-3-319-66700-3_13","DOI":"10.1007\/978-3-319-66700-3_13"},{"key":"9752_CR12","doi-asserted-by":"publisher","unstructured":"Bil\u00f2, D., Friedrich, T., Lenzner, P., Lowski, S., & Melnichenko, A. (2021). Selfish creation of social networks. In AAAI 2021, pp. 5185\u20135193. https:\/\/doi.org\/10.1145\/3323165.3323199","DOI":"10.1145\/3323165.3323199"},{"issue":"4","key":"9752_CR13","doi-asserted-by":"publisher","first-page":"915","DOI":"10.1007\/S00355-024-01562-X","volume":"64","author":"M Bullinger","year":"2025","unstructured":"Bullinger, M., Lenzner, P., & Melnichenko, A. (2025). Network creation with homophilic agents. Social Choice and Welfare., 64(4), 915\u2013959. https:\/\/doi.org\/10.1007\/S00355-024-01562-X","journal-title":"Social Choice and Welfare."},{"issue":"3","key":"9752_CR14","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/s100580000019","volume":"5","author":"V Bala","year":"2000","unstructured":"Bala, V., & Goyal, S. (2000). A strategic analysis of network reliability. Review of Economic Design., 5(3), 205\u2013228.","journal-title":"Review of Economic Design."},{"issue":"2","key":"9752_CR15","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/j.mathsocsci.2005.02.003","volume":"50","author":"H Haller","year":"2005","unstructured":"Haller, H., & Sarangi, S. (2005). Nash networks with heterogeneous links. Mathematical Social Sciences., 50(2), 181\u2013201.","journal-title":"Mathematical Social Sciences."},{"issue":"3","key":"9752_CR16","doi-asserted-by":"publisher","first-page":"302","DOI":"10.3390\/g2030302","volume":"2","author":"L Kliemann","year":"2011","unstructured":"Kliemann, L. (2011). The price of anarchy for network formation in an adversary model. Games., 2(3), 302\u2013332. https:\/\/doi.org\/10.3390\/g2030302","journal-title":"Games."},{"key":"9752_CR17","doi-asserted-by":"publisher","unstructured":"Meirom, E.A., Mannor, S., & Orda, A. (2015). Formation games of reliable networks. In INFOCOM 2015, pp. 1760\u20131768. https:\/\/doi.org\/10.1109\/INFOCOM.2015.7218557","DOI":"10.1109\/INFOCOM.2015.7218557"},{"key":"9752_CR18","doi-asserted-by":"publisher","unstructured":"Chauhan, A., Lenzner, P., Melnichenko, A., & M\u00fcnn, M. (2016). On selfish creation of robust networks. In SAGT 2016, pp. 141\u2013152. https:\/\/doi.org\/10.1007\/978-3-662-53354-3_12","DOI":"10.1007\/978-3-662-53354-3_12"},{"key":"9752_CR19","doi-asserted-by":"publisher","unstructured":"Goyal, S., Jabbari, S., Kearns, M.J., Khanna, S., & Morgenstern, J. (2016). Strategic network formation with attack and immunization. In WINE 2016, pp. 429\u2013443. https:\/\/doi.org\/10.1007\/978-3-662-54110-4_30","DOI":"10.1007\/978-3-662-54110-4_30"},{"key":"9752_CR20","doi-asserted-by":"publisher","unstructured":"Echzell, H., Friedrich, T., Lenzner, P., & Melnichenko, A. (2020). Flow-based network creation games. In IJCAI 2020, pp. 139\u2013145. https:\/\/doi.org\/10.24963\/ijcai.2020\/20","DOI":"10.24963\/ijcai.2020\/20"},{"key":"9752_CR21","doi-asserted-by":"publisher","unstructured":"Moscibroda, T., Schmid, S., & Wattenhofer, R. (2006). On the topologies formed by selfish peers. In PODC 2006, pp. 133\u2013142. https:\/\/doi.org\/10.1145\/1146381.1146403","DOI":"10.1145\/1146381.1146403"},{"issue":"2","key":"9752_CR22","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. S. A., & Zust, S. (2006). Equilibria in topology control games for ad hoc networks. Mobile Networks and Applications, 11(2), 143\u2013159. https:\/\/doi.org\/10.1007\/s11036-005-4468-y","journal-title":"Mobile Networks and Applications"},{"issue":"1","key":"9752_CR23","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. (2024). Geometric network creation games. SIAM Journal on Discrete Mathematics, 38(1), 277\u2013315. https:\/\/doi.org\/10.1137\/20M1376662","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"9752_CR24","doi-asserted-by":"publisher","unstructured":"Friedemann, W., Friedrich, T., Gawendowicz, H., Lenzner, P., Melnichenko, A., Peters, J., Stephan, D., & Vaichenker, M. (2021) Efficiency and stability in euclidean network design. In SPAA 2021, pp. 232\u2013242. https:\/\/doi.org\/10.1145\/3409964.3461807","DOI":"10.1145\/3409964.3461807"},{"key":"9752_CR25","doi-asserted-by":"publisher","unstructured":"Corbo, J., & Parkes, D.C. (2005). The price of selfish behavior in bilateral network formation. In PODC 2005, pp. 99\u2013107. https:\/\/doi.org\/10.1145\/1073814.1073833","DOI":"10.1145\/1073814.1073833"},{"key":"9752_CR26","doi-asserted-by":"publisher","unstructured":"Demaine, E.D., Hajiaghayi, M., Mahini, H., & Zadimoghaddam, M. (2009). The price of anarchy in cooperative network creation games. In STACS 2009, pp. 301\u2013312. https:\/\/doi.org\/10.4230\/LIPICS.STACS.2009.1839","DOI":"10.4230\/LIPICS.STACS.2009.1839"},{"issue":"2","key":"9752_CR27","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. (2009). Strong price of anarchy. Games and Economic Behavior, 65(2), 289\u2013317. https:\/\/doi.org\/10.1016\/j.geb.2008.03.005","journal-title":"Games and Economic Behavior"},{"key":"9752_CR28","doi-asserted-by":"publisher","unstructured":"Friedrich, T., Gawendowicz, H., Lenzner, P., & Zahn, A. (2023). The impact of cooperation in bilateral network creation. In PODC 2023, pp. 321\u2013331. https:\/\/doi.org\/10.1145\/3583668.3594588","DOI":"10.1145\/3583668.3594588"},{"issue":"7","key":"9752_CR29","doi-asserted-by":"publisher","first-page":"2087","DOI":"10.1007\/S00453-022-01089-6","volume":"85","author":"T Friedrich","year":"2023","unstructured":"Friedrich, T., Gawendowicz, H., Lenzner, P., & Melnichenko, A. (2023). Social distancing network creation. Algorithmica., 85(7), 2087\u20132130. https:\/\/doi.org\/10.1007\/S00453-022-01089-6","journal-title":"Algorithmica."},{"issue":"1","key":"9752_CR30","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1038\/ncomms8651","volume":"6","author":"A Guly\u00e1s","year":"2015","unstructured":"Guly\u00e1s, A., B\u00edr\u00f3, J. J., K\u0151r\u00f6si, A., R\u00e9tv\u00e1ri, G., & Krioukov, D. (2015). Navigable networks as Nash equilibria of navigation games. Nature communications., 6(1), 1\u201310.","journal-title":"Nature communications."},{"key":"9752_CR31","doi-asserted-by":"publisher","unstructured":"Berger, J., Friedrich, T., Lenzner, P., Machaira, P., & Ruff, J. (2025). Strategic network creation for enabling greedy routing. In AAAI 2025, pp. 13622\u201313630. https:\/\/doi.org\/10.1609\/AAAI.V39I13.33488","DOI":"10.1609\/AAAI.V39I13.33488"},{"key":"9752_CR32","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1007\/978-3-642-35311-6_11","volume":"2012","author":"P Lenzner","year":"2012","unstructured":"Lenzner, P. (2012). Greedy selfish network creation. In: WINE, 2012, 142\u2013155. https:\/\/doi.org\/10.1007\/978-3-642-35311-6_11","journal-title":"Greedy selfish network creation. In: WINE"},{"issue":"5","key":"9752_CR33","doi-asserted-by":"publisher","first-page":"1181","DOI":"10.1111\/1468-0262.00155","volume":"68","author":"V Bala","year":"2000","unstructured":"Bala, V., & Goyal, S. (2000). A noncooperative model of network formation. Econometrica., 68(5), 1181\u20131229.","journal-title":"Econometrica."},{"key":"9752_CR34","doi-asserted-by":"publisher","unstructured":"Friedrich, T., Ihde, S., Ke\u00dfler, C., Lenzner, P., Neubert, S., & Schumann, D. (2017). Efficient best response computation for strategic network formation under attack. In SAGT 2017, pp. 199\u2013211. https:\/\/doi.org\/10.1007\/978-3-319-66700-3_16","DOI":"10.1007\/978-3-319-66700-3_16"},{"key":"9752_CR35","doi-asserted-by":"publisher","unstructured":"Chen, Y., Jabbari, S., Kearns, M.J., Khanna, S., & Morgenstern, J. (2019). Network formation under random attack and probabilistic spread. In IJCAI 2019, pp. 180\u2013186. ijcai.org. https:\/\/doi.org\/10.24963\/IJCAI.2019\/26","DOI":"10.24963\/IJCAI.2019\/26"},{"issue":"4","key":"9752_CR36","doi-asserted-by":"publisher","first-page":"820","DOI":"10.1006\/jcss.2002.1829","volume":"64","author":"D Kempe","year":"2002","unstructured":"Kempe, D., Kleinberg, J., & Kumar, A. (2002). Connectivity and inference problems for temporal networks. Journal of Computer and System Sciences., 64(4), 820\u2013842. https:\/\/doi.org\/10.1006\/jcss.2002.1829","journal-title":"Journal of Computer and System Sciences."},{"key":"9752_CR37","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.jcss.2021.04.004","volume":"121","author":"A Casteigts","year":"2021","unstructured":"Casteigts, A., Peters, J. G., & Schoeters, J. (2021). Temporal cliques admit sparse spanners. The Journal of Computer and System Sciences, 121, 1\u201317. https:\/\/doi.org\/10.1016\/j.jcss.2021.04.004","journal-title":"The Journal of Computer and System Sciences"},{"key":"9752_CR38","doi-asserted-by":"publisher","unstructured":"Bil\u00f2, D., D\u2019Angelo, G., Gual\u00e0, L., Leucci, S., & Rossi, M. (2022). Sparse temporal spanners with low stretch. In ESA 2022, pp. 19\u201311916. https:\/\/doi.org\/10.4230\/LIPIcs.ESA.2022.19","DOI":"10.4230\/LIPIcs.ESA.2022.19"},{"key":"9752_CR39","doi-asserted-by":"publisher","unstructured":"Axiotis, K., & Fotakis, D. (2016). On the size and the approximability of minimum temporally connected subgraphs. In ICALP 2016, pp. 149\u2013114914. https:\/\/doi.org\/10.4230\/LIPIcs.ICALP.2016.149","DOI":"10.4230\/LIPIcs.ICALP.2016.149"},{"key":"9752_CR40","doi-asserted-by":"publisher","unstructured":"Klobas, N., Mertzios, G.B., Molter, H., & Spirakis, P.G. (2022). The complexity of computing optimum labelings for temporal connectivity. In MFCS 2022, pp. 62\u201316215. https:\/\/doi.org\/10.4230\/LIPIcs.MFCS.2022.62","DOI":"10.4230\/LIPIcs.MFCS.2022.62"}],"container-title":["Autonomous Agents and Multi-Agent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10458-026-09752-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10458-026-09752-w","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10458-026-09752-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,13]],"date-time":"2026-05-13T16:19:47Z","timestamp":1778689187000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10458-026-09752-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,5,9]]},"references-count":40,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,6]]}},"alternative-id":["9752"],"URL":"https:\/\/doi.org\/10.1007\/s10458-026-09752-w","relation":{},"ISSN":["1387-2532","1573-7454"],"issn-type":[{"value":"1387-2532","type":"print"},{"value":"1573-7454","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,5,9]]},"assertion":[{"value":"26 July 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 April 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 May 2026","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"26"}}