{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T03:17:27Z","timestamp":1743131847258,"version":"3.40.3"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031157134"},{"type":"electronic","value":"9783031157141"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-15714-1_14","type":"book-chapter","created":{"date-parts":[[2022,9,13]],"date-time":"2022-09-13T17:26:44Z","timestamp":1663090004000},"page":"241-257","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["An Improved Bound for\u00a0the\u00a0Tree Conjecture in\u00a0Network Creation Games"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8087-3009","authenticated-orcid":false,"given":"Jack","family":"Dippel","sequence":"first","affiliation":[]},{"given":"Adrian","family":"Vetta","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,9,14]]},"reference":[{"key":"14_CR1","doi-asserted-by":"publisher","first-page":"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\u201327 (2014)","journal-title":"ACM Trans. Econ. Comput."},{"key":"14_CR2","doi-asserted-by":"publisher","first-page":"656","DOI":"10.1137\/090771478","volume":"27","author":"N Alon","year":"2013","unstructured":"Alon, N., Demaine, E., Hajiaghayi, M., Leighton, T.: Basic network creation games. SIAM J. Discret. Math. 27, 656\u2013668 (2013)","journal-title":"SIAM J. Discret. Math."},{"key":"14_CR3","unstructured":"Alvarez, C., Messegue, A.: Network creation games: structure vs anarchy. arXiv:1706.09132"},{"key":"14_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1007\/978-3-030-35389-6_23","volume-title":"Web and Internet Economics","author":"C \u00c0lvarez","year":"2019","unstructured":"\u00c0lvarez, C., Messegu\u00e9, A.: On the price of anarchy for high-price links. In: Caragiannis, I., Mirrokni, V., Nikolova, E. (eds.) WINE 2019. LNCS, vol. 11920, pp. 316\u2013329. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-35389-6_23"},{"key":"14_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"},{"key":"14_CR6","first-page":"210","volume":"3","author":"D Bilo","year":"2014","unstructured":"Bilo, D., Guala, L., Leucci, S., Proietti, G.: Locality-based network creation games. ACM Trans. Parallel Comput. 3, 210\u2013223 (2014)","journal-title":"ACM Trans. Parallel Comput."},{"issue":"3","key":"14_CR7","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1007\/s00224-019-09945-9","volume":"64","author":"D Bil\u00f2","year":"2019","unstructured":"Bil\u00f2, D., Lenzner, P.: On the tree conjecture for the network creation game. Theory Comput. Syst. 64(3), 422\u2013443 (2019). https:\/\/doi.org\/10.1007\/s00224-019-09945-9","journal-title":"Theory Comput. Syst."},{"key":"14_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"},{"key":"14_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1007\/978-3-319-66700-3_13","volume-title":"Algorithmic Game Theory","author":"A Chauhan","year":"2017","unstructured":"Chauhan, A., Lenzner, P., Melnichenko, A., Molitor, L.: Selfish network creation with non-uniform edge cost. In: Bil\u00f2, V., Flammini, M. (eds.) SAGT 2017. LNCS, vol. 10504, pp. 160\u2013172. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-66700-3_13"},{"key":"14_CR10","first-page":"1","volume":"8","author":"E Demaine","year":"2012","unstructured":"Demaine, E., Hajiaghayi, M., Mahini, H., Zadimoghaddam, M.: The price of anarchy in cooperative network creation games. ACM Trans. Econ. Comput. 8, 1\u201320 (2012)","journal-title":"ACM Trans. Econ. Comput."},{"key":"14_CR11","doi-asserted-by":"crossref","unstructured":"Fabrikant, A., Luthra, A., Maneva, E., Papadimitriou, C., Shenker, S.: On a network creation game. In: Proceedings of 22nd Symposium on Principles of Distributed Computing (PODC), pp. 347\u2013351 (2003)","DOI":"10.1145\/872035.872088"},{"key":"14_CR12","unstructured":"Lenzner, P.: On selfish network creation. Humboldt-Universit\u00e4t zu Berlin (2014)"},{"key":"14_CR13","doi-asserted-by":"publisher","first-page":"472","DOI":"10.1080\/15427951.2015.1016248","volume":"11","author":"A Mamageishvili","year":"2015","unstructured":"Mamageishvili, A., Mihalak, M., Muller, D.: Tree Nash equilibria in the network creation game. Internet Math. 11, 472\u2013486 (2015)","journal-title":"Internet Math."},{"key":"14_CR14","first-page":"53","volume":"53","author":"M Mihalak","year":"2013","unstructured":"Mihalak, M., Schlegel, J.: The price of anarchy in network creation games is (mostly) constant. Theoret. Comput. Sci. 53, 53\u201372 (2013)","journal-title":"Theoret. Comput. Sci."}],"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-031-15714-1_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,13]],"date-time":"2022-09-13T17:28:08Z","timestamp":1663090088000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-15714-1_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031157134","9783031157141"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-15714-1_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"14 September 2022","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":"Colchester","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 September 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 September 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sagt2022","order":10,"name":"conference_id","label":"Conference ID","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":"83","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":"34","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":"41% - 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.01","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":"6.9","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)"}}]}}