{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T03:49:30Z","timestamp":1743133770030,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319035352"},{"type":"electronic","value":"9783319035369"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-319-03536-9_17","type":"book-chapter","created":{"date-parts":[[2013,12,9]],"date-time":"2013-12-09T01:59:42Z","timestamp":1386554382000},"page":"220-231","source":"Crossref","is-referenced-by-count":4,"title":["Anarchy Is Free in Network Creation"],"prefix":"10.1007","author":[{"given":"Ronald","family":"Graham","sequence":"first","affiliation":[]},{"given":"Linus","family":"Hamilton","sequence":"additional","affiliation":[]},{"given":"Ariel","family":"Levavi","sequence":"additional","affiliation":[]},{"given":"Po-Shen","family":"Loh","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"17_CR1","doi-asserted-by":"crossref","unstructured":"Fabrikant, A., Luthra, A., Maneva, E., Papadimitriou, C.H., Shenker, S.: On a network creation game. In: Proc. 22nd Symposium on Principles of Distributed Computing, PODC 2003, pp. 347\u2013351 (2003)","DOI":"10.1145\/872035.872088"},{"key":"17_CR2","first-page":"295","volume-title":"Proc. 45th IEEE Symposium on Foundations of Computer Science, FOCS 2004","author":"E. Anshelevich","year":"2004","unstructured":"Anshelevich, E., Dasgupta, A., Kleinberg, J., Tardos, E., Wexler, T., Roughgarden, T.: The price of stability for network design with fair cost allocation. In: Proc. 45th IEEE Symposium on Foundations of Computer Science, FOCS 2004, pp. 295\u2013304. IEEE Computer Society, Washington, DC (2004)"},{"key":"17_CR3","first-page":"511","volume-title":"Proc. 35th ACM Symposium on Theory of Computing, STOC 2003","author":"E. Anshelevich","year":"2003","unstructured":"Anshelevich, E., Dasgupta, A., Tardos, E., Wexler, T.: Near-optimal network design with selfish agents. In: Proc. 35th ACM Symposium on Theory of Computing, STOC 2003, pp. 511\u2013520. ACM, New York (2003)"},{"key":"17_CR4","unstructured":"Czumaj, A., V\u00f6cking, B.: Tight bounds for worst-case equilibria. In: Proc. 13th ACM-SIAM Symposium on Discrete Algorithms, SODA 2002 (2002)"},{"key":"17_CR5","first-page":"749","volume-title":"Proc. 33rd ACM Symposium on Theory of Computing, STOC 2001","author":"C. Papadimitriou","year":"2001","unstructured":"Papadimitriou, C.: Algorithms, games, and the internet. In: Proc. 33rd ACM Symposium on Theory of Computing, STOC 2001, pp. 749\u2013753. ACM, New York (2001)"},{"key":"17_CR6","doi-asserted-by":"crossref","unstructured":"Roughgarden, T.: The price of anarchy is independent of the network topology. In: Proc. 34th ACM Symposium on Theory of Computing, STOC 2002, pp. 428\u2013437 (2002)","DOI":"10.1145\/509907.509971"},{"key":"17_CR7","doi-asserted-by":"crossref","unstructured":"Roughgarden, T.: Selfish Routing and the Price of Anarchy. MIT Press (2005)","DOI":"10.21236\/ADA637949"},{"key":"17_CR8","first-page":"294","volume-title":"Proc. 19th ACM-SIAM Symposium on Discrete Algorithms, SODA 2008","author":"S. Albers","year":"2008","unstructured":"Albers, S.: On the value of coordination in network design. In: Proc. 19th ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, pp. 294\u2013303. Society for Industrial and Applied Mathematics, Philadelphia (2008)"},{"key":"17_CR9","doi-asserted-by":"crossref","unstructured":"Albers, S., Eilts, S., Even-dar, E., Mansour, Y., Roditty, L.: On Nash equilibria for a network creation game. In: Proc. 16th ACM-SIAM Symposium on Discrete Algorithms, SODA 2006, pp. 89\u201398 (2006)","DOI":"10.1145\/1109557.1109568"},{"key":"17_CR10","first-page":"106","volume-title":"Proc. 22nd ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2010","author":"N. Alon","year":"2010","unstructured":"Alon, N., Demaine, E.D., Hajiaghayi, M., Leighton, T.: Basic network creation games. In: Proc. 22nd ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2010, pp. 106\u2013113. ACM, New York (2010)"},{"key":"17_CR11","first-page":"189","volume-title":"Proc. 18th ACM-SIAM Symposium on Discrete Algorithms, SODA 2007","author":"N. Andelman","year":"2007","unstructured":"Andelman, N., Feldman, M., Mansour, Y.: Strong price of anarchy. In: Proc. 18th ACM-SIAM Symposium on Discrete Algorithms, SODA 2007, pp. 189\u2013198. Society for Industrial and Applied Mathematics, Philadelphia (2007)"},{"key":"17_CR12","first-page":"99","volume-title":"Proc. 24th ACM Symposium on Principles of Distributed Computing, PODC 2005","author":"J. Corbo","year":"2005","unstructured":"Corbo, J., Parkes, D.: The price of selfish behavior in bilateral network formation. In: Proc. 24th ACM Symposium on Principles of Distributed Computing, PODC 2005, pp. 99\u2013107. ACM, New York (2005)"},{"key":"17_CR13","doi-asserted-by":"crossref","unstructured":"Demaine, E.D., Hajiaghayi, M., Mahini, H., Zadimoghaddam, M.: The price of anarchy in network creation games. ACM Transactions on Algorithms\u00a08(2), Paper 13 (April 2012)","DOI":"10.1145\/2151171.2151176"},{"issue":"1","key":"17_CR14","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. Theory Comput. Syst.\u00a053(1), 53\u201372 (2013)","journal-title":"Theory Comput. Syst."},{"key":"17_CR15","doi-asserted-by":"crossref","unstructured":"Jackson, M.O.: A survey of network formation models: stability and efficiency. In: Demange, G., Wooders, M. (eds.) Group Formation in Economics; Networks, Clubs, and Coalitions. Cambridge University Press (2005)","DOI":"10.1017\/CBO9780511614385.002"},{"key":"17_CR16","doi-asserted-by":"crossref","unstructured":"Tardos, E., Wexler, T.: Network formation games and the potential function method. In: Nisan, N., Roughgarden, T., Tardos, E., Vazirani, V.V. (eds.) Algorithmic Game Theory, pp. 487\u2013516. Cambridge University Press (2007)","DOI":"10.1017\/CBO9780511800481.021"},{"key":"17_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"404","DOI":"10.1007\/3-540-49116-3_38","volume-title":"STACS 99","author":"E. Koutsoupias","year":"1999","unstructured":"Koutsoupias, E., Papadimitriou, C.: Worst-case equilibria. In: Meinel, C., Tison, S. (eds.) STACS 1999. LNCS, vol.\u00a01563, pp. 404\u2013413. Springer, Heidelberg (1999)"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Models for the Web Graph"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-03536-9_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,7]],"date-time":"2023-02-07T19:22:45Z","timestamp":1675797765000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-03536-9_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783319035352","9783319035369"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-03536-9_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}