{"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":1778344245184,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":46,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,6,17]],"date-time":"2019-06-17T00:00:00Z","timestamp":1560729600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"COST Action CA16228 European Network for Game Theory (GAMENET)"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,6,17]]},"DOI":"10.1145\/3323165.3323199","type":"proceedings-article","created":{"date-parts":[[2019,6,18]],"date-time":"2019-06-18T12:14:30Z","timestamp":1560860070000},"page":"323-332","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["Geometric Network Creation Games"],"prefix":"10.1145","author":[{"given":"Davide","family":"Bil\u00f2","sequence":"first","affiliation":[{"name":"University of Sassari, Sassari, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tobias","family":"Friedrich","sequence":"additional","affiliation":[{"name":"Hasso Plattner Institute, University of Potsdam, Potsdam, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pascal","family":"Lenzner","sequence":"additional","affiliation":[{"name":"Hasso Plattner Institute, University of Potsdam, Potsdam, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anna","family":"Melnichenko","sequence":"additional","affiliation":[{"name":"Hasso Plattner Institute, University of Potsdam, Potsdam, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2019,6,17]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"45th International Colloquium on Automata, Languages, and Programming, ICALP 2018","author":"Adamaszek A.","year":"2018","unstructured":"A. Adamaszek , M. Mnich , and K. Paluch . New approximation algorithms for (1, 2)-tsp. In 45th International Colloquium on Automata, Languages, and Programming, ICALP 2018 , July 9 --13 , 2018 , Prague, Czech Republic, pages 9:1--9:14, 2018. A. Adamaszek, M. Mnich, and K. Paluch. New approximation algorithms for (1, 2)-tsp. In 45th International Colloquium on Automata, Languages, and Programming, ICALP 2018, July 9--13, 2018, Prague, Czech Republic, pages 9:1--9:14, 2018."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/1109557.1109568"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1810479.1810502"},{"key":"e_1_3_2_1_4_1","volume-title":"Network creation games: Structure vs anarchy. arXiv preprint arXiv:1706.09132","author":"\u00c0lvarez C.","year":"2017","unstructured":"C. \u00c0lvarez and A. Messegu\u00e9 . Network creation games: Structure vs anarchy. arXiv preprint arXiv:1706.09132 , 2017 . C. \u00c0lvarez and A. Messegu\u00e9. Network creation games: Structure vs anarchy. arXiv preprint arXiv:1706.09132, 2017."},{"key":"e_1_3_2_1_5_1","volume-title":"On the constant price of anarchy conjecture. arXiv preprint arXiv:1809.08027","author":"\u00c0lvarez C.","year":"2018","unstructured":"C. \u00c0lvarez and A. Messegu\u00e9 . On the constant price of anarchy conjecture. arXiv preprint arXiv:1809.08027 , 2018 . C. \u00c0lvarez and A. Messegu\u00e9. On the constant price of anarchy conjecture. arXiv preprint arXiv:1809.08027, 2018."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1137\/070680096"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.4086\/toc.2008.v004a004"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1111\/1468-0262.00155"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/1109557.1109627"},{"key":"e_1_3_2_1_10_1","volume-title":"Geometric network creation games. arXiv preprint arXiv:1904.07001","author":"Bil\u00f2 D.","year":"2019","unstructured":"D. Bil\u00f2 , T. Friedrich , P. Lenzner , and A. Melnichenko . Geometric network creation games. arXiv preprint arXiv:1904.07001 , 2019 . D. Bil\u00f2, T. Friedrich, P. Lenzner, and A. Melnichenko. Geometric network creation games. arXiv preprint arXiv:1904.07001, 2019."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-35311-6_29"},{"key":"e_1_3_2_1_12_1","first-page":"210","volume-title":"21st International Colloquium, SIROCCO 2014, Takayama, Japan, July 23--25, 2014. Proceedings","author":"Bil\u00f2 D.","year":"2014","unstructured":"D. Bil\u00f2 , L. Gual\u00e0 , S. Leucci , and G. Proietti . Network creation games with trace route-based strategies. In Structural Information and Communication Complexity - 21st International Colloquium, SIROCCO 2014, Takayama, Japan, July 23--25, 2014. Proceedings , pages 210 -- 223 , 2014 . D. Bil\u00f2, L. Gual\u00e0, S. Leucci, and G. Proietti. Network creation games with trace route-based strategies. In Structural Information and Communication Complexity - 21st International Colloquium, SIROCCO 2014, Takayama, Japan, July 23--25, 2014. Proceedings, pages 210--223, 2014."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2938426"},{"key":"e_1_3_2_1_14_1","first-page":"1","volume-title":"35th Symposium on Theoretical Aspects of Computer Science","author":"Bil\u00f2 D.","year":"2018","unstructured":"D. Bil\u00f2 and P. Lenzner . On the tree conjecture for the network creation game . In 35th Symposium on Theoretical Aspects of Computer Science , page 1 , 2018 . D. Bil\u00f2 and P. Lenzner. On the tree conjecture for the network creation game. In 35th Symposium on Theoretical Aspects of Computer Science, page 1, 2018."},{"key":"e_1_3_2_1_15_1","first-page":"160","volume-title":"SAGT 2017, L'Aquila, Italy, September 12--14, 2017","author":"Chauhan A.","year":"2017","unstructured":"A. Chauhan , P. Lenzner , A. Melnichenko , and L. Molitor . Selfish network creation with non-uniform edge cost. In Algorithmic Game Theory - 10th International Symposium , SAGT 2017, L'Aquila, Italy, September 12--14, 2017 , Proceedings , pages 160 -- 172 , 2017 . A. Chauhan, P. Lenzner, A. Melnichenko, and L. Molitor. Selfish network creation with non-uniform edge cost. In Algorithmic Game Theory - 10th International Symposium, SAGT 2017, L'Aquila, Italy, September 12--14, 2017, Proceedings, pages 160--172, 2017."},{"key":"e_1_3_2_1_16_1","first-page":"141","volume-title":"SAGT'16","author":"Chauhan A.","year":"2016","unstructured":"A. Chauhan , P. Lenzner , A. Melnichenko , and M. M\u00fc nn. On selfish creation of robust networks . In SAGT'16 , pages 141 -- 152 , 2016 . A. Chauhan, P. Lenzner, A. Melnichenko, and M. M\u00fc nn. On selfish creation of robust networks. In SAGT'16, pages 141--152, 2016."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-48054-0_21"},{"key":"e_1_3_2_1_18_1","first-page":"423","volume-title":"WINE'14","author":"Cord-Landwehr A.","year":"2014","unstructured":"A. Cord-Landwehr , A. M\"acker, and F. M. auf der Heide. Quality of service in network creation games . In WINE'14 , pages 423 -- 428 . Springer , 2014 . A. Cord-Landwehr, A. M\"acker, and F. M. auf der Heide. Quality of service in network creation games. In WINE'14, pages 423--428. Springer, 2014."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1980522.1980524"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/2151171.2151176"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11036-005-4468-y"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/872035.872088"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/3087556.3087594"},{"key":"e_1_3_2_1_24_1","volume-title":"Computers and intractability","author":"Garey M. R.","year":"2002","unstructured":"M. R. Garey and D. S. Johnson . Computers and intractability , volume 29 . wh freeman New York , 2002 . M. R. Garey and D. S. Johnson. Computers and intractability, volume 29. wh freeman New York, 2002."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-54110-4_30"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/MAHC.1985.10011"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1038\/ncomms8651"},{"key":"e_1_3_2_1_28_1","first-page":"167","volume-title":"11th Annual International Conference, COCOON 2005, Kunming, China, August 16--29, 2005","author":"Hoefer M.","year":"2005","unstructured":"M. Hoefer and P. Krysta . Geometric network design with selfish agents. In Computing and Combinatorics , 11th Annual International Conference, COCOON 2005, Kunming, China, August 16--29, 2005 , Proceedings , pages 167 -- 178 , 2005 . M. Hoefer and P. Krysta. Geometric network design with selfish agents. In Computing and Combinatorics, 11th Annual International Conference, COCOON 2005, Kunming, China, August 16--29, 2005, Proceedings, pages 167--178, 2005."},{"key":"e_1_3_2_1_29_1","volume-title":"The Steiner tree problem","author":"Hwang F. K.","year":"1992","unstructured":"F. K. Hwang , D. S. Richards , and P. Winter . The Steiner tree problem , volume 53 . Elsevier , 1992 . F. K. Hwang, D. S. Richards, and P. Winter. The Steiner tree problem, volume 53. Elsevier, 1992."},{"key":"e_1_3_2_1_30_1","volume-title":"A strategic model of social and economic networks. Journal of economic theory, 71(1):44--74","author":"Jackson M. O.","year":"1996","unstructured":"M. O. Jackson and A. Wolinsky . A strategic model of social and economic networks. Journal of economic theory, 71(1):44--74 , 1996 . M. O. Jackson and A. Wolinsky. A strategic model of social and economic networks. Journal of economic theory, 71(1):44--74, 1996."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230080402"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/2486159.2486185"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.3390\/g2030302"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.5555\/1764891.1764944"},{"key":"e_1_3_2_1_36_1","first-page":"254","volume-title":"On dynamics in basic network creation games","author":"Lenzner P.","year":"2011","unstructured":"P. Lenzner . On dynamics in basic network creation games . In G. Persiano, editor, SAGT'11, volume 6982 , pages 254 -- 265 . Springer Berlin \/ Heidelberg , 2011 . P. Lenzner. On dynamics in basic network creation games. In G. Persiano, editor, SAGT'11, volume 6982, pages 254--265. Springer Berlin \/ Heidelberg, 2011."},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-35311-6_11"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.18.1.1"},{"key":"e_1_3_2_1_39_1","series-title":"LNCS","first-page":"118","volume-title":"WAW'13","author":"Mamageishvili A.","year":"2013","unstructured":"A. Mamageishvili , M. Mihal\u00e1k , and D. M\u00fcller . Tree nash equilibria in the network creation game . In WAW'13 , volume 8305 of LNCS , pages 118 -- 129 . Springer , 2013 . A. Mamageishvili, M. Mihal\u00e1k, and D. M\u00fcller. Tree nash equilibria in the network creation game. In WAW'13, volume 8305 of LNCS, pages 118--129. Springer, 2013."},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/2600057.2602862"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2015.7218557"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.5555\/1929237.1929261"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-32589-2_60"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1006\/game.1996.0044"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/1146381.1146403"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/380752.380883"}],"event":{"name":"SPAA '19: 31st ACM Symposium on Parallelism in Algorithms and Architectures","location":"Phoenix AZ USA","acronym":"SPAA '19","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory","SIGARCH ACM Special Interest Group on Computer Architecture","EATCS European Association for Theoretical Computer Science"]},"container-title":["The 31st ACM Symposium on Parallelism in Algorithms and Architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3323165.3323199","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3323165.3323199","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:23:16Z","timestamp":1750202596000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3323165.3323199"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,6,17]]},"references-count":46,"alternative-id":["10.1145\/3323165.3323199","10.1145\/3323165"],"URL":"https:\/\/doi.org\/10.1145\/3323165.3323199","relation":{},"subject":[],"published":{"date-parts":[[2019,6,17]]},"assertion":[{"value":"2019-06-17","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}