{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,11]],"date-time":"2026-05-11T10:50:24Z","timestamp":1778496624972,"version":"3.51.4"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319666990","type":"print"},{"value":"9783319667003","type":"electronic"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-66700-3_13","type":"book-chapter","created":{"date-parts":[[2017,8,18]],"date-time":"2017-08-18T12:38:47Z","timestamp":1503059927000},"page":"160-172","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["Selfish Network Creation with Non-uniform Edge Cost"],"prefix":"10.1007","author":[{"given":"Ankit","family":"Chauhan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pascal","family":"Lenzner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anna","family":"Melnichenko","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Louise","family":"Molitor","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,8,19]]},"reference":[{"issue":"1","key":"13_CR1","first-page":"2","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 TEAC 2(1), 2 (2014)","journal-title":"ACM TEAC"},{"issue":"2","key":"13_CR2","doi-asserted-by":"publisher","first-page":"656","DOI":"10.1137\/090771478","volume":"27","author":"N Alon","year":"2013","unstructured":"Alon, N., Demaine, E.D., Hajiaghayi, M.T., Leighton, T.: Basic network creation games. SIAM J. Discret. Math. 27(2), 656\u2013668 (2013)","journal-title":"SIAM J. Discret. Math."},{"key":"13_CR3","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. Theor. Comput. Sci. 648, 56\u201371 (2016)","journal-title":"Theor. Comput. Sci."},{"key":"13_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1007\/978-3-319-49787-7_8","volume-title":"Algorithms and Models for the Web Graph","author":"C \u00c0lvarez","year":"2016","unstructured":"\u00c0lvarez, C., Messegu\u00e8, A.: Max celebrity games. In: Bonato, A., Graham, F.C., Pra\u0142at, P. (eds.) WAW 2016. LNCS, vol. 10088, pp. 88\u201399. Springer, Cham (2016). doi:10.1007\/978-3-319-49787-7_8"},{"issue":"5","key":"13_CR5","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.: A noncooperative model of network formation. Econometrica 68(5), 1181\u20131229 (2000)","journal-title":"Econometrica"},{"key":"13_CR6","volume-title":"Network Science","author":"A-L Barab\u00e1si","year":"2016","unstructured":"Barab\u00e1si, A.-L.: Network Science. Cambridge University Press, Cambridge (2016)"},{"key":"13_CR7","doi-asserted-by":"crossref","unstructured":"Bil\u00f2, D., Gual\u00e0, L., Leucci, S., Proietti, G.: Locality-based network creation games. In: SPAA 2014, pp. 277\u2013286. ACM, New York (2014)","DOI":"10.1145\/2612669.2612680"},{"key":"13_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1007\/978-3-319-09620-9_17","volume-title":"Structural Information and Communication Complexity","author":"D Bil\u00f2","year":"2014","unstructured":"Bil\u00f2, D., Gual\u00e0, L., Leucci, S., Proietti, G.: Network creation games with traceroute-based strategies. In: Halld\u00f3rsson, M.M. (ed.) SIROCCO 2014. LNCS, vol. 8576, pp. 210\u2013223. Springer, Cham (2014). doi:10.1007\/978-3-319-09620-9_17"},{"key":"13_CR9","doi-asserted-by":"crossref","unstructured":"Chauhan, A., Lenzner, P., Melnichenko, A., Molitor, L.: Selfish network creation with non-uniform edge cost (2017). arXiv preprint arXiv:1706.10200","DOI":"10.1007\/978-3-319-66700-3_13"},{"key":"13_CR10","doi-asserted-by":"crossref","unstructured":"Corbo, J., Parkes, D.: The price of selfish behavior in bilateral network formation. In: PODC 2005, pp. 99\u2013107. ACM, New York (2005)","DOI":"10.1145\/1073814.1073833"},{"key":"13_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1007\/978-3-662-48054-0_21","volume-title":"Mathematical Foundations of Computer Science 2015","author":"A Cord-Landwehr","year":"2015","unstructured":"Cord-Landwehr, A., Lenzner, P.: Network creation games: think global \u2013 act local. In: Italiano, G.F., Pighizzini, G., Sannella, D.T. (eds.) MFCS 2015. LNCS, vol. 9235, pp. 248\u2013260. Springer, Heidelberg (2015). doi:10.1007\/978-3-662-48054-0_21"},{"key":"13_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1007\/978-3-319-13129-0_34","volume-title":"Web and Internet Economics","author":"A Cord-Landwehr","year":"2014","unstructured":"Cord-Landwehr, A., M\u00e4cker, A., auf der Heide, F.M.: Quality of service in network creation games. In: Liu, T.-Y., Qi, Q., Ye, Y. (eds.) WINE 2014. LNCS, vol. 8877, pp. 423\u2013428. Springer, Cham (2014). doi:10.1007\/978-3-319-13129-0_34"},{"issue":"2","key":"13_CR13","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1145\/2151171.2151176","volume":"8","author":"ED Demaine","year":"2012","unstructured":"Demaine, E.D., Hajiaghayi, M.T., Mahini, H., Zadimoghaddam, M.: The price of anarchy in network creation games. ACM Trans. Algorithms 8(2), 13 (2012)","journal-title":"ACM Trans. Algorithms"},{"key":"13_CR14","doi-asserted-by":"crossref","unstructured":"Fabrikant, A., Luthra, A., Maneva, E., Papadimitriou, C.H., Shenker, S.: On a network creation game. In: PODC 2003, pp. 347\u2013351. ACM, New York (2003)","DOI":"10.1145\/872035.872088"},{"issue":"2","key":"13_CR15","first-page":"15","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)","journal-title":"ACM Trans. Algorithms (TALG)"},{"issue":"1","key":"13_CR16","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1006\/jeth.1996.0108","volume":"71","author":"MO Jackson","year":"1996","unstructured":"Jackson, M.O., Wolinsky, A.: A strategic model of social and economic networks. J. Econ. Theory 71(1), 44\u201374 (1996)","journal-title":"J. Econ. Theory"},{"key":"13_CR17","doi-asserted-by":"crossref","unstructured":"Kawald, B., Lenzner, P.: On dynamics in selfish network creation. In: SPAA 2013, pp. 83\u201392. ACM (2013)","DOI":"10.1145\/2486159.2486185"},{"key":"13_CR18","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. 6982, pp. 254\u2013265. Springer, Heidelberg (2011). doi:10.1007\/978-3-642-24829-0_23"},{"key":"13_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1007\/978-3-642-35311-6_11","volume-title":"Internet and Network Economics","author":"P Lenzner","year":"2012","unstructured":"Lenzner, P.: Greedy selfish network creation. In: Goldberg, P.W. (ed.) WINE 2012. LNCS, vol. 7695, pp. 142\u2013155. Springer, Heidelberg (2012). doi:10.1007\/978-3-642-35311-6_11"},{"key":"13_CR20","doi-asserted-by":"crossref","unstructured":"Leskovec, J., Kleinberg, J., Faloutsos, C.: Graphs over time: densification laws, shrinking diameters and possible explanations. In: SIGKDD 2005, pp. 177\u2013187. ACM (2005)","DOI":"10.1145\/1081870.1081893"},{"key":"13_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1007\/978-3-319-03536-9_10","volume-title":"Algorithms and Models for the Web Graph","author":"A Mamageishvili","year":"2013","unstructured":"Mamageishvili, A., Mihal\u00e1k, M., M\u00fcller, D.: Tree Nash equilibria in the network creation game. In: Bonato, A., Mitzenmacher, M., Pra\u0142at, P. (eds.) WAW 2013. LNCS, vol. 8305, pp. 118\u2013129. Springer, Cham (2013). doi:10.1007\/978-3-319-03536-9_10"},{"key":"13_CR22","doi-asserted-by":"crossref","unstructured":"Meirom, E.A., Mannor, S., Orda, A.: Network formation games with heterogeneous players and the internet structure. In: EC 2014, pp. 735\u2013752. ACM (2014)","DOI":"10.1145\/2600057.2602862"},{"key":"13_CR23","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. 6386, pp. 276\u2013287. Springer, Heidelberg (2010). doi:10.1007\/978-3-642-16170-4_24"},{"key":"13_CR24","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.C.: Asymmetric swap-equilibrium: a unifying equilibrium concept for network creation games. In: Rovan, B., Sassone, V., Widmayer, P. (eds.) MFCS 2012. LNCS, vol. 7464, pp. 693\u2013704. Springer, Heidelberg (2012). doi:10.1007\/978-3-642-32589-2_60"},{"issue":"1","key":"13_CR25","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)","journal-title":"Games Econ. Behav."},{"key":"13_CR26","doi-asserted-by":"crossref","unstructured":"Papadimitriou, C.H.: Algorithms, games, and the internet. In: Proceedings on 33rd Annual ACM Symposium on Theory of Computing, pp. 749\u2013753 (2001)","DOI":"10.1145\/380752.380883"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Game Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-66700-3_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T16:26:31Z","timestamp":1709828791000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-66700-3_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319666990","9783319667003"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-66700-3_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"19 August 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SAGT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Algorithmic Game Theory","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"L'Aquila","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":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 September 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 September 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sagt2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cs.gssi.infn.it\/sagt2017","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}