{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T13:51:08Z","timestamp":1770990668371,"version":"3.50.1"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030549206","type":"print"},{"value":"9783030549213","type":"electronic"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","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":[[2020]]},"DOI":"10.1007\/978-3-030-54921-3_20","type":"book-chapter","created":{"date-parts":[[2020,7,29]],"date-time":"2020-07-29T11:04:28Z","timestamp":1596020668000},"page":"349-365","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Network Creation Games with Local Information and Edge Swaps"],"prefix":"10.1007","author":[{"given":"Shotaro","family":"Yoshimura","sequence":"first","affiliation":[]},{"given":"Yukiko","family":"Yamauchi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,7,28]]},"reference":[{"issue":"1","key":"20_CR1","doi-asserted-by":"publisher","first-page":"2:1","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:1\u20132:27 (2014)","journal-title":"ACM Trans. Econ. Comput."},{"key":"20_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. Discrete Math. 27, 656\u2013668 (2013)","journal-title":"SIAM J. Discrete Math."},{"key":"20_CR3","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1038\/scientificamerican0503-60","volume":"288","author":"AL Barab\u00e1si","year":"2003","unstructured":"Barab\u00e1si, A.L., Bonabeau, E.: Scale-free networks. Sci. Am. 288, 50\u201359 (2003)","journal-title":"Sci. Am."},{"key":"20_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/978-3-642-14162-1_11","volume-title":"Automata, Languages and Programming","author":"P Berenbrink","year":"2010","unstructured":"Berenbrink, P., Czyzowicz, J., Els\u00e4sser, R., G\u0105sieniec, L.: Efficient information exchange in the random phone-call model. In: Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., Spirakis, P.G. (eds.) ICALP 2010. LNCS, vol. 6199, pp. 127\u2013138. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14162-1_11"},{"key":"20_CR5","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). https:\/\/doi.org\/10.1007\/978-3-319-09620-9_17"},{"issue":"1","key":"20_CR6","doi-asserted-by":"publisher","first-page":"6:1","DOI":"10.1145\/2938426","volume":"3","author":"D Bil\u00f2","year":"2016","unstructured":"Bil\u00f2, D., Gual\u00e0, L., Leucci, S., Proietti, G.: Locality-based network creation games. ACM Trans. Parallel Comput. 3(1), 6:1\u20136:26 (2016)","journal-title":"ACM Trans. Parallel Comput."},{"key":"20_CR7","unstructured":"Bil\u00f2, D., Lenzner, P.: On the tree conjecture for the network creation game. In: Proceedings of STACS 2018, pp. 14:1\u201314:15 (2018)"},{"key":"20_CR8","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). https:\/\/doi.org\/10.1007\/978-3-662-48054-0_21"},{"issue":"2","key":"20_CR9","doi-asserted-by":"publisher","first-page":"13:1","DOI":"10.1145\/2151171.2151176","volume":"8","author":"ED Demaine","year":"2012","unstructured":"Demaine, E.D., Hajiaghayi, M., Mahini, H., Zadimoghaddam, M.: The price of anarchy in network creation games. ACM Trans. Algorithms 8(2), 13:1\u201313:13 (2012)","journal-title":"ACM Trans. Algorithms"},{"key":"20_CR10","doi-asserted-by":"crossref","unstructured":"Domingos, P., Richardson, M.: Mining the network value of customers. In: Proceedings of KDD 2001, pp. 57\u201366 (2001)","DOI":"10.1145\/502512.502525"},{"issue":"10","key":"20_CR11","doi-asserted-by":"publisher","first-page":"3682","DOI":"10.1073\/pnas.1200709109","volume":"109","author":"R Durrett","year":"2012","unstructured":"Durrett, R., et al.: Graph fission in an evolving voter model. Proc. Natl. Acad. Sci. 109(10), 3682\u20133687 (2012)","journal-title":"Proc. Natl. Acad. Sci."},{"key":"20_CR12","doi-asserted-by":"crossref","unstructured":"Fabrikant, A., Luthra, A., Maneva, E., Papadimitriou, C.H., Shenker, S.: On a network creation game. In: Proceedings of PODC 2003, pp. 347\u2013351 (2003)","DOI":"10.1145\/872035.872088"},{"key":"20_CR13","unstructured":"Karp, R.M., Schindelhauer, C., Shenker, S., Vocking, B.: Randomized rumor spreading. In: Proceedings of FOCS 2000, pp. 565\u2013574 (2000)"},{"key":"20_CR14","doi-asserted-by":"crossref","unstructured":"Kawald, B., Lenzner, P.: On dynamics in selfish network creation. In: Proceedings of SPAA 2013, pp. 83\u201392 (2013)","DOI":"10.1145\/2486159.2486185"},{"key":"20_CR15","doi-asserted-by":"crossref","unstructured":"Kempe, D., Kleinberg, J., Tardos, E.: Maximizing the spread of influence through a social network. In: KDD 2003, pp. 137\u2013146 (2003)","DOI":"10.1145\/956750.956769"},{"key":"20_CR16","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). https:\/\/doi.org\/10.1007\/978-3-642-24829-0_23"},{"key":"20_CR17","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). https:\/\/doi.org\/10.1007\/978-3-319-03536-9_10"},{"issue":"1","key":"20_CR18","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. Theor. Comput. Syst. 53(1), 53\u201372 (2013)","journal-title":"Theor. Comput. Syst."},{"key":"20_CR19","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, 124\u2013143 (1996)","journal-title":"Games Econ. Behav."},{"key":"20_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1007\/3-540-48686-0_33","volume-title":"Computing and Combinatorics","author":"T Nakata","year":"1999","unstructured":"Nakata, T., Imahayashi, H., Yamashita, M.: Probabilistic local majority voting for the agreement problem on finite graphs. In: Asano, T., Imai, H., Lee, D.T., Nakano, S., Tokuyama, T. (eds.) COCOON 1999. LNCS, vol. 1627, pp. 330\u2013338. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48686-0_33"},{"key":"20_CR21","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1038\/30918","volume":"393","author":"DJ Watts","year":"1998","unstructured":"Watts, D.J., Strogatz, S.H.: Collective dynamics of \u2018small-world\u2019 networks. Nature 393, 440\u2013442 (1998)","journal-title":"Nature"}],"container-title":["Lecture Notes in Computer Science","Structural Information and Communication Complexity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-54921-3_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,24]],"date-time":"2021-04-24T02:44:56Z","timestamp":1619232296000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-54921-3_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030549206","9783030549213"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-54921-3_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"28 July 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SIROCCO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Colloquium on Structural Information and Communication Complexity","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Paderborn","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 June 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 July 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sirocco2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sirocco2020.cs.uni-paderborn.de\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"41","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"19","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"46% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"11","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The conference was held virtually due to the COVID-19 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}