{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T12:42:37Z","timestamp":1725453757157},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642387678"},{"type":"electronic","value":"9783642387685"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38768-5_4","type":"book-chapter","created":{"date-parts":[[2013,5,17]],"date-time":"2013-05-17T04:31:28Z","timestamp":1368765088000},"page":"17-28","source":"Crossref","is-referenced-by-count":3,"title":["On the Sequential Price of Anarchy of Isolation Games"],"prefix":"10.1007","author":[{"given":"Anna","family":"Angelucci","sequence":"first","affiliation":[]},{"given":"Vittorio","family":"Bil\u00f2","sequence":"additional","affiliation":[]},{"given":"Michele","family":"Flammini","sequence":"additional","affiliation":[]},{"given":"Luca","family":"Moscardelli","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"4_CR1","doi-asserted-by":"crossref","unstructured":"Anshelevich, E., Dasgupta, A., Tardos, \u00c9., Wexler, T.: Near-Optimal Network Design with Selfish Agents. In: Proceedings of the 35th Annual ACM Symposium on Theory of Computing (STOC), pp. 511\u2013520. ACM Press (2003)","DOI":"10.1145\/780615.780617"},{"issue":"3","key":"4_CR2","doi-asserted-by":"publisher","first-page":"660","DOI":"10.1016\/j.tcs.2009.10.007","volume":"411","author":"V. Bil\u00f2","year":"2010","unstructured":"Bil\u00f2, V., Fanelli, A., Flammini, M., Moscardelli, L.: When Ignorance Helps: Graphical Multicast Cost Sharing Games. Theoretical Compututer Science\u00a0411(3), 660\u2013671 (2010)","journal-title":"Theoretical Compututer Science"},{"issue":"22","key":"4_CR3","doi-asserted-by":"publisher","first-page":"2296","DOI":"10.1016\/j.tcs.2011.01.008","volume":"412","author":"V. Bil\u00f2","year":"2011","unstructured":"Bil\u00f2, V., Flammini, M.: Extending the Notion of Rationality of Selfish Agents: Second Order Nash Equilibria. Theoretical Computer Science\u00a0412(22), 2296\u20132311 (2011)","journal-title":"Theoretical Computer Science"},{"key":"4_CR4","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1007\/s10878-010-9300-3","volume":"22","author":"V. Bil\u00f2","year":"2011","unstructured":"Bil\u00f2, V., Flammini, M., Monaco, G., Moscardelli, L.: On the Performances of Nash Equilibria in Isolation Games. Journal of Combinatorial Optimization\u00a022, 378\u2013397 (2011)","journal-title":"Journal of Combinatorial Optimization"},{"key":"4_CR5","unstructured":"Bil\u00f2, V., Flammini, M., Monaco, G., Moscardelli, L.: Some Anomalies of Farsighted Strategic Behavior. In: Proceedings of the 10th Workshop on Approximation and Online Algorithms (WAOA), Ljubljana, Slovenia, September 13-14 (2012)"},{"key":"4_CR6","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/s00454-003-2951-4","volume":"31","author":"O. Cheong","year":"2004","unstructured":"Cheong, O., Har-Peled, S., Linial, N., Matousek, J.: The One-Round Voronoi Game. Discrete and Computational Geometry\u00a031, 125\u2013138 (2004)","journal-title":"Discrete and Computational Geometry"},{"key":"4_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/978-3-540-75520-3_4","volume-title":"Algorithms \u2013 ESA 2007","author":"C. D\u00fcrr","year":"2007","unstructured":"D\u00fcrr, C., Thang, N.K.: Nash Equilibria in Voronoi Games on Graphs. In: Arge, L., Hoffmann, M., Welzl, E. (eds.) ESA 2007. LNCS, vol.\u00a04698, pp. 17\u201328. Springer, Heidelberg (2007)"},{"issue":"1","key":"4_CR8","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1287\/trsc.27.1.44","volume":"27","author":"H.A. Eiselt","year":"1993","unstructured":"Eiselt, H.A., Laporte, G., Thisse, J.F.: Competitive Location Models: A Framework and Bibliography. Transportation Science\u00a027(1), 44\u201354 (1993)","journal-title":"Transportation Science"},{"issue":"153","key":"4_CR9","first-page":"41","volume":"39","author":"H. Hotelling","year":"1929","unstructured":"Hotelling, H.: Stability in Competition. Computational Geometry: Theory and Applications\u00a039(153), 41\u201357 (1929)","journal-title":"Computational Geometry: Theory and Applications"},{"key":"4_CR10","doi-asserted-by":"crossref","unstructured":"Jain, A.K., Murty, M.N., Flynn, P.J.: Data Clustering: A Review. ACM Computing Surveys\u00a031(3) (1999)","DOI":"10.1145\/331499.331504"},{"key":"4_CR11","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":"4_CR12","doi-asserted-by":"crossref","unstructured":"Paes Leme, R., Syrgkanis, V., Tardos, \u00c9.: The Curse of Simultaneity. In: Proceedings of Innovations in Theoretical Computer Science (ITCS), pp. 60\u201367. ACM Press (2012)","DOI":"10.1145\/2090236.2090242"},{"key":"4_CR13","doi-asserted-by":"crossref","unstructured":"Paes Leme, R., Syrgkanis, V., Tardos, \u00c9.: Sequential Auctions and Externalities. In: Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 869\u2013886. SIAM (2012)","DOI":"10.1137\/1.9781611973099.70"},{"key":"4_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1007\/978-3-540-85238-4_41","volume-title":"Mathematical Foundations of Computer Science 2008","author":"M. Mavronicolas","year":"2008","unstructured":"Mavronicolas, M., Monien, B., Papadopoulou, V.G., Schoppmann, F.: Voronoi Games on Cycle Graphs. In: Ochma\u0144ski, E., Tyszkiewicz, J. (eds.) MFCS 2008. LNCS, vol.\u00a05162, pp. 503\u2013514. Springer, Heidelberg (2008)"},{"issue":"2","key":"4_CR15","doi-asserted-by":"publisher","first-page":"286","DOI":"10.2307\/1969529","volume":"54","author":"J. Nash","year":"1951","unstructured":"Nash, J.: Non-Cooperative Games. Annals of Mathematics\u00a054(2), 286\u2013295 (1951)","journal-title":"Annals of Mathematics"},{"key":"4_CR16","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511800481","volume-title":"Algorithmic Game Theory","author":"N. Nisan","year":"2007","unstructured":"Nisan, N., Roughgarden, T., Tardos, \u00c9., Vazirani, V.: Algorithmic Game Theory. Cambridge University Press, Cambridge (2007)"},{"key":"4_CR17","unstructured":"Osborne, M.J., Rubinstein, A.: A Course in Game Theory. MIT Press (1994)"},{"issue":"1","key":"4_CR18","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1006\/jagm.1998.0963","volume":"30","author":"S.H. Teng","year":"1999","unstructured":"Teng, S.H.: Low Energy and Mutually Distant Sampling. Journal of Algorithms\u00a030(1), 42\u201367 (1999)","journal-title":"Journal of Algorithms"},{"key":"4_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1007\/978-3-540-92182-0_16","volume-title":"Algorithms and Computation","author":"Y. Zhao","year":"2008","unstructured":"Zhao, Y., Chen, W., Teng, S.-H.: The Isolation Game: A Game of Distances. In: Hong, S.-H., Nagamochi, H., Fukunaga, T. (eds.) ISAAC 2008. LNCS, vol.\u00a05369, pp. 148\u2013158. Springer, Heidelberg (2008)"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38768-5_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,13]],"date-time":"2019-05-13T02:11:37Z","timestamp":1557713497000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38768-5_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642387678","9783642387685"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38768-5_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}