{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T16:28:48Z","timestamp":1725812928124},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319131283"},{"type":"electronic","value":"9783319131290"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-13129-0_36","type":"book-chapter","created":{"date-parts":[[2014,12,1]],"date-time":"2014-12-01T06:08:41Z","timestamp":1417414121000},"page":"435-440","source":"Crossref","is-referenced-by-count":2,"title":["Multilevel Network Games"],"prefix":"10.1007","author":[{"given":"Sebastian","family":"Abshoff","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andreas","family":"Cord-Landwehr","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel","family":"Jung","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander","family":"Skopalik","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"36_CR1","unstructured":"Abshoff, S., Cord-Landwehr, A., Jung, D., Skopalik, A.: Multilevel Network Games. CoRR (2014), \n                    \n                      arxiv.org\/abs\/1409.5383"},{"key":"36_CR2","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: Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). ACM (2006)","DOI":"10.1145\/1109557.1109568"},{"key":"36_CR3","doi-asserted-by":"crossref","unstructured":"Alon, N., Demaine, E.D., Hajiaghayi, M., Leighton, T.: Basic network creation games. In: Proceedings of the 22nd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA). ACM (2010)","DOI":"10.1145\/1810479.1810502"},{"key":"36_CR4","doi-asserted-by":"crossref","unstructured":"Demaine, E.D., Hajiaghayi, M., Mahini, H., Zadimoghaddam, M.: The price of anarchy in network creation games. In: Proceedings of the 26th Annual ACM Symposium on Principles of Distributed Computing (PODC). ACM (2007)","DOI":"10.1145\/1281100.1281142"},{"key":"36_CR5","doi-asserted-by":"crossref","unstructured":"Fabrikant, A., Luthra, A., Maneva, E., Papadimitriou, C.H., Shenker, S.: On a network creation game. In: Proceedings of the 22nd Annual Symposium on Principles of Distributed Computing (PODC). ACM (2003)","DOI":"10.1145\/872035.872088"},{"key":"36_CR6","doi-asserted-by":"crossref","unstructured":"Kawald, B., Lenzner, P.: On Dynamics in Selfish Network Creation. In: Proceedings of the 25th Annual ACM Symposium on Parallelism in Algorithms and Architectures (SPAA). ACM (2013)","DOI":"10.1145\/2486159.2486185"},{"key":"36_CR7","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":"36_CR8","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.\u00a07695, pp. 142\u2013155. Springer, Heidelberg (2012)"},{"key":"36_CR9","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.\u00a08305, pp. 118\u2013129. Springer, Heidelberg (2013)"},{"key":"36_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.) SAGT 2010. LNCS, vol.\u00a06386, pp. 276\u2013287. Springer, Heidelberg (2010)"},{"key":"36_CR11","doi-asserted-by":"crossref","unstructured":"Monderer, D., Shapley, L.S.: Potential Games. Games and Economic Behavior 14(1) (1996)","DOI":"10.1006\/game.1996.0044"},{"key":"36_CR12","doi-asserted-by":"crossref","unstructured":"Young, H.P.: The evolution of conventions. Econometrica: Journal of the Econometric Society (1993)","DOI":"10.2307\/2951778"}],"container-title":["Lecture Notes in Computer Science","Web and Internet Economics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-13129-0_36","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T17:20:59Z","timestamp":1559064059000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-13129-0_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319131283","9783319131290"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-13129-0_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}