{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T13:52:09Z","timestamp":1770990729008,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642248283","type":"print"},{"value":"9783642248290","type":"electronic"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-24829-0_23","type":"book-chapter","created":{"date-parts":[[2011,10,3]],"date-time":"2011-10-03T09:11:38Z","timestamp":1317633098000},"page":"254-265","source":"Crossref","is-referenced-by-count":25,"title":["On Dynamics in Basic Network Creation Games"],"prefix":"10.1007","author":[{"given":"Pascal","family":"Lenzner","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"23_CR1","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1145\/1109557.1109568","volume-title":"Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithm, SODA 2006","author":"S. Albers","year":"2006","unstructured":"Albers, S., Eilts, S., Even-Dar, E., Mansour, Y., Roditty, L.: On nash equilibria for a network creation game. In: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithm, SODA 2006, pp. 89\u201398. ACM, New York (2006)"},{"key":"23_CR2","first-page":"106","volume-title":"SPAA 2010: Proceedings of the 22nd ACM Symposium on Parallelism in Algorithms and Architectures","author":"N. Alon","year":"2010","unstructured":"Alon, N., Demaine, E.D., Hajiaghayi, M., Leighton, T.: Basic network creation games. In: SPAA 2010: Proceedings of the 22nd ACM Symposium on Parallelism in Algorithms and Architectures, pp. 106\u2013113. ACM, New York (2010)"},{"key":"23_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1007\/978-3-540-79309-0_20","volume-title":"Algorithmic Game Theory","author":"N. Baumann","year":"2008","unstructured":"Baumann, N., Stiller, S.: The price of anarchy of a network creation game with exponential payoff. In: Monien, B., Schroeder, U.-P. (eds.) SAGT 2008. LNCS, vol.\u00a04997, pp. 218\u2013229. Springer, Heidelberg (2008)"},{"key":"23_CR4","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1145\/1281100.1281142","volume-title":"Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, PODC 2007","author":"E.D. Demaine","year":"2007","unstructured":"Demaine, E.D., Hajiaghayi, M., Mahini, H., Zadimoghaddam, M.: The price of anarchy in network creation games. In: Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, PODC 2007, pp. 292\u2013298. ACM, New York (2007)"},{"key":"23_CR5","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1145\/872035.872088","volume-title":"Proceedings of the Twenty-Second Annual Symposium on Principles of Distributed Computing, PODC 2003","author":"A. Fabrikant","year":"2003","unstructured":"Fabrikant, A., Luthra, A., Maneva, E., Papadimitriou, C.H., Shenker, S.: On a network creation game. In: Proceedings of the Twenty-Second Annual Symposium on Principles of Distributed Computing, PODC 2003, pp. 347\u2013351. ACM, New York (2003)"},{"key":"23_CR6","unstructured":"Jackson, M.O.: A survey of models of network formation: Stability and efficiency. Group Formation in Economics: Networks, Clubs and Coalitions (2003)"},{"issue":"3","key":"23_CR7","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1137\/0137041","volume":"37","author":"O. Kariv","year":"1979","unstructured":"Kariv, O., Hakimi, S.L.: An algorithmic approach to network location problems. ii: The p-medians. SIAM Journal on Applied Mathematics\u00a037(3), 539\u2013560 (1979)","journal-title":"SIAM Journal on Applied Mathematics"},{"key":"23_CR8","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)"},{"key":"23_CR9","unstructured":"Lin, H.: On the price of anarchy of a network creation game. Class final project (2003)"},{"key":"23_CR10","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.) Algorithmic Game Theory. LNCS, vol.\u00a06386, pp. 276\u2013287. Springer, Heidelberg (2010)"},{"issue":"1","key":"23_CR11","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 and Economic Behavior\u00a014(1), 124\u2013143 (1996)","journal-title":"Games and Economic Behavior"},{"key":"23_CR12","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511800481","volume-title":"Algorithmic Game Theory","author":"N. Nisan","year":"2007","unstructured":"Nisan, N., Roughgarden, T., Tardos, E., Vazirani, V.V.: Algorithmic Game Theory. Cambridge University Press, New York (2007)"},{"issue":"3","key":"23_CR13","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/S0165-1765(99)00196-2","volume":"66","author":"M. Voorneveld","year":"2000","unstructured":"Voorneveld, M.: Best-response potential games. Economics Letters\u00a066(3), 289\u2013295 (2000)","journal-title":"Economics Letters"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Game Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-24829-0_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,9]],"date-time":"2019-04-09T05:51:49Z","timestamp":1554789109000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-24829-0_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642248283","9783642248290"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-24829-0_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011]]}}}