{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,9]],"date-time":"2024-08-09T14:34:54Z","timestamp":1723214094635},"reference-count":42,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2013,12,13]],"date-time":"2013-12-13T00:00:00Z","timestamp":1386892800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2015,1]]},"DOI":"10.1007\/s10878-013-9694-9","type":"journal-article","created":{"date-parts":[[2013,12,12]],"date-time":"2013-12-12T10:44:37Z","timestamp":1386845077000},"page":"165-181","source":"Crossref","is-referenced-by-count":7,"title":["On the sequential price of anarchy of isolation games"],"prefix":"10.1007","volume":"29","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","published-online":{"date-parts":[[2013,12,13]]},"reference":[{"key":"9694_CR1","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1016\/j.tcs.2013.05.041","volume":"495","author":"R Adar","year":"2013","unstructured":"Adar R, Epstein L (2013) Selfish bin packing with cardinality constraints. Theor Comput Sci 495:66\u201380","journal-title":"Theor Comput Sci"},{"issue":"5","key":"9694_CR2","doi-asserted-by":"crossref","first-page":"1211","DOI":"10.1137\/090748986","volume":"40","author":"S Aland","year":"2011","unstructured":"Aland S, Dumrauf D, Gairing M, Monien B, Schoppmann F (2011) Exact price of anarchy for polynomial congestion games. SIAM J Comput 40(5):1211\u20131233","journal-title":"SIAM J Comput"},{"key":"9694_CR3","doi-asserted-by":"crossref","unstructured":"Anshelevich E, Dasgupta A, Tardos \u00c9, Wexler T (2003) Near-optimal network design with selfish agents. In: Proceedings of the 35th annual ACM symposium on theory of computing (STOC). ACM Press, New York, pp 511\u2013520","DOI":"10.1145\/780542.780617"},{"key":"9694_CR4","doi-asserted-by":"crossref","unstructured":"Awerbuch B, Azar Y, Epstein A (2005) The price of routing unsplittable flow. In: Proceedings of the 37th annual ACM symposium on theory of computing (STOC). ACM Press, New York, pp 57\u201366","DOI":"10.1145\/1060590.1060599"},{"issue":"4","key":"9694_CR5","doi-asserted-by":"crossref","first-page":"655","DOI":"10.1007\/s10878-011-9447-6","volume":"26","author":"A Banik","year":"2013","unstructured":"Banik A, Bhattacharya BB, Das S (2013) Optimal strategies for the one-round discrete Voronoi game on a line. J Comb Optim 26(4):655\u2013669","journal-title":"J Comb Optim"},{"key":"9694_CR6","doi-asserted-by":"crossref","unstructured":"Bil\u00f2 V (2006) On the packing of selfish items. In: Proceedings of the 20th international parallel and distributed processing symposium (IPDPS). IEEE Computer Society, New York, p 9","DOI":"10.1109\/IPDPS.2006.1639283"},{"key":"9694_CR7","doi-asserted-by":"crossref","unstructured":"Bil\u00f2 V, Flammini M (2011) Extending the notion of rationality of selfish agents: second order Nash equilibria. Theor Comput Sci 412(22):2296\u20132311","DOI":"10.1016\/j.tcs.2011.01.008"},{"issue":"3","key":"9694_CR8","doi-asserted-by":"crossref","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 (2010) When ignorance helps: graphical multicast cost sharing games. Theor Comput Sci 411(3):660\u2013671","journal-title":"Theor Comput Sci"},{"key":"9694_CR9","doi-asserted-by":"crossref","unstructured":"Bil\u00f2 V, Flammini M, Monaco G, Moscardelli L (2011) On the performances of Nash equilibria in isolation games. J Comb Optim 22:378\u2013397","DOI":"10.1007\/s10878-010-9300-3"},{"key":"9694_CR10","unstructured":"Bil\u00f2 V, Flammini M, Monaco G, Moscardelli L (2012) Some anomalies of farsighted strategic behavior. In: Proceedings of the 10th workshop on approximation and online algorithms (WAOA). LNCS 7846. Springer, Berlin, pp 229\u2013241"},{"key":"9694_CR11","doi-asserted-by":"crossref","unstructured":"Bil\u00f2 V, Caragiannis I, Fanelli A, Monaco G (2013a) Improved lower bounds on the price of stability of undirected network design games. Theory Comput Syst 52(4):668\u2013686","DOI":"10.1007\/s00224-012-9411-6"},{"key":"9694_CR12","doi-asserted-by":"crossref","unstructured":"Bil\u00f2 V, Flammini M, Moscardelli L (2013b) The price of stability for undirected broadcast network design with fair cost allocation is constant. In: Proceedings of the 54th symposium on foundations of computer science (FOCS). IEEE Computer Society, New York, pp 638\u2013647","DOI":"10.1109\/FOCS.2013.74"},{"issue":"3","key":"9694_CR13","doi-asserted-by":"crossref","first-page":"606","DOI":"10.1007\/s00453-010-9427-8","volume":"61","author":"I Caragiannis","year":"2011","unstructured":"Caragiannis I, Flammini M, Kaklamanis C, Kanellopoulos P, Moscardelli L (2011) Tight bounds for selfish and greedy load balancing. Algorithmica 61(3):606\u2013637","journal-title":"Algorithmica"},{"issue":"16\u201318","key":"9694_CR14","doi-asserted-by":"crossref","first-page":"1855","DOI":"10.1016\/j.tcs.2010.02.005","volume":"411","author":"J Cardinal","year":"2010","unstructured":"Cardinal J, Hoefer M (2010) Non-cooperative facility location and covering games. Theor Comput Sci 411(16\u201318):1855\u20131876","journal-title":"Theor Comput Sci"},{"key":"9694_CR15","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1016\/j.tcs.2013.02.033","volume":"482","author":"X Chen","year":"2013","unstructured":"Chen X, Epstein L, Kleiman E, van Stee R (2013) Maximizing the minimum load: the cost of selfishness. Theor Comput Sci 482:9\u201319","journal-title":"Theor Comput Sci"},{"key":"9694_CR16","doi-asserted-by":"crossref","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 (2004) The one-round Voronoi game. Discret Comput Geom 31:125\u2013138","journal-title":"Discret Comput Geom"},{"key":"9694_CR17","doi-asserted-by":"crossref","unstructured":"Christodoulou G, Koutsoupias E (2005a) The price of anarchy of finite congestion games. In: Proceedings of the 37th annual ACM symposium on theory of computing (STOC). ACM Press, New York, pp 67\u201373","DOI":"10.1145\/1060590.1060600"},{"key":"9694_CR18","doi-asserted-by":"crossref","unstructured":"Christodoulou G, Koutsoupias E (2005b) On the price of anarchy and stability of correlated equilibria of linear congestion games. In: Proceedings of the 13th annual European symposium on algorithms (ESA). LNCS 3669. Springer, New York, pp 59\u201370","DOI":"10.1007\/11561071_8"},{"issue":"1","key":"9694_CR19","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1145\/1186810.1186814","volume":"3","author":"A Czumaj","year":"2007","unstructured":"Czumaj A, V\u00f6cking B (2007) Tight bounds for worst-case equilibria. ACM Trans Algorithms 3(1):4","journal-title":"ACM Trans Algorithms"},{"key":"9694_CR20","doi-asserted-by":"crossref","unstructured":"D\u00fcrr C, Thang NK (2007) Nash equilibria in Voronoi games on graphs. In: Proceedings of the 15th annual European symposium on algorithms (ESA). LNCS 4698. Springer, New York, pp 17\u201328","DOI":"10.1007\/978-3-540-75520-3_4"},{"issue":"1","key":"9694_CR21","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1287\/trsc.27.1.44","volume":"27","author":"HA Eiselt","year":"1993","unstructured":"Eiselt HA, Laporte G, Thisse JF (1993) Competitive location models: a framework and bibliography. Transp Sci 27(1):44\u201354","journal-title":"Transp Sci"},{"issue":"2","key":"9694_CR22","doi-asserted-by":"crossref","first-page":"368","DOI":"10.1007\/s00453-009-9348-6","volume":"60","author":"L Epstein","year":"2001","unstructured":"Epstein L, Kleiman E (2001) Selfish bin packing. Algorithmica 60(2):368\u2013394","journal-title":"Algorithmica"},{"issue":"1","key":"9694_CR23","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1016\/j.tcs.2009.08.032","volume":"411","author":"L Epstein","year":"2010","unstructured":"Epstein L, van Stee R (2010) Maximizing the minimum load for selfish agents. Theor Comput Sci 411(1):44\u201357","journal-title":"Theor Comput Sci"},{"key":"9694_CR24","doi-asserted-by":"crossref","unstructured":"Epstein L, Kleiman E, Mestre J (2009) Parametric packing of selfish items and the subset sum algorithm. In: Proceedings of the 5th international workshop on internet and network economics (WINE). LNCS 5929. Springer, Berlin, pp 67\u201378","DOI":"10.1007\/978-3-642-10841-9_8"},{"issue":"4","key":"9694_CR25","doi-asserted-by":"crossref","first-page":"531","DOI":"10.1007\/s10878-010-9302-1","volume":"22","author":"L Epstein","year":"2011","unstructured":"Epstein L, Krumke SO, Levin A, Sperber H (2011) Selfish bin coloring. J Comb Optim 22(4):531\u2013548","journal-title":"J Comb Optim"},{"key":"9694_CR26","doi-asserted-by":"crossref","unstructured":"Epstein L, Kleiman E, van Stee R (2012) The cost of selfishness for maximizing the minimum load on uniformly related machines. J Comb Optim. doi: 10.1007\/s10878-012-9555-y","DOI":"10.1007\/s10878-012-9555-y"},{"key":"9694_CR27","doi-asserted-by":"crossref","unstructured":"Fiat A, Kaplan H, Levy M, Olonetsky S, Shabo R (2006) On the Price of stability for designing undirected networks with fair cost allocations. In: Proceedings of the 33rd international colloquium on automata, languages and programming (ICALP). LNCS 4051. Springer, New York, pp 608\u2013618","DOI":"10.1007\/11786986_53"},{"issue":"3","key":"9694_CR28","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1145\/331499.331504","volume":"31","author":"AK Jain","year":"1999","unstructured":"Jain AK, Murty MN, Flynn PJ (1999) Data clustering: a review. ACM Comput Surv 31(3):264\u2013323","journal-title":"ACM Comput Surv"},{"key":"9694_CR29","doi-asserted-by":"crossref","unstructured":"Koutsoupias E, Papadimitriou CH (1999) Worst-case equilibria. In: Proceedings of the 16th international symposium on theoretical aspects of computer science (STACS). LNCS 1653. Springer, New York, pp 404\u2013413","DOI":"10.1007\/3-540-49116-3_38"},{"key":"9694_CR30","doi-asserted-by":"crossref","unstructured":"Lee E, Ligett K (2013) Improved bounds on the price of stability in network cost sharing games. In: Proceedings of the 14th ACM conference on electronic commerce (EC). ACM Press, New York, pp 607\u2013620","DOI":"10.1145\/2492002.2482562"},{"key":"9694_CR31","doi-asserted-by":"crossref","unstructured":"Leme RP, Syrgkanis V, Tardos \u00c9 (2012a) Sequential auctions and externalities. In: Proceedings of the twenty-third annual ACM\u2013SIAM symposium on discrete algorithms (SODA). SIAM, New Orleans, pp 869\u2013886","DOI":"10.1137\/1.9781611973099.70"},{"key":"9694_CR32","doi-asserted-by":"crossref","unstructured":"Leme RP, Syrgkanis V, Tardos \u00c9 (2012b) The curse of simultaneity. In: Proceedings of innovations in theoretical computer science (ITCS). ACM Press, New York, pp 60\u201367","DOI":"10.1145\/2090236.2090242"},{"issue":"15","key":"9694_CR33","doi-asserted-by":"crossref","first-page":"876","DOI":"10.1016\/j.ipl.2009.04.015","volume":"109","author":"J Li","year":"2009","unstructured":"Li J (2009) An $$O(\\log n\/\\log \\log n)$$ O ( log n \/ log log n ) upper bound on the price of stability for undirected Shapley network design games. Inf Process Lett 109(15):876\u2013878","journal-title":"Inf Process Lett"},{"key":"9694_CR34","doi-asserted-by":"crossref","unstructured":"Mavronicolas M, Spirakis PG (2001) The price of selfish routing. In: Proceedings of the 33rd annual ACM symposium on theory of computing (STOC). ACM Press, New York, pp 510\u2013519","DOI":"10.1145\/380752.380846"},{"key":"9694_CR35","doi-asserted-by":"crossref","unstructured":"Mavronicolas M, Monien B, Papadopoulou VG, Schoppmann F (2008) Voronoi games on cycle graphs. In: Proceedings of the 33rd international symposium on mathematical foundations of computer science (MFCS). LNCS 5162. Springer, New York, pp 503\u2013514","DOI":"10.1007\/978-3-540-85238-4_41"},{"issue":"2","key":"9694_CR36","doi-asserted-by":"crossref","first-page":"286","DOI":"10.2307\/1969529","volume":"54","author":"J Nash","year":"1951","unstructured":"Nash J (1951) Non-cooperative games. Ann Math 54(2):286\u2013295","journal-title":"Ann Math"},{"key":"9694_CR37","volume-title":"A course in game theory","author":"MJ Osborne","year":"1994","unstructured":"Osborne MJ, Rubinstein A (1994) A course in game theory. MIT Press, Cambridge"},{"issue":"2","key":"9694_CR38","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1145\/506147.506153","volume":"49","author":"T Roughgarden","year":"2002","unstructured":"Roughgarden T, Tardos \u00c9 (2002) How bad is selfish routing? J ACM 49(2):236\u2013259","journal-title":"J ACM"},{"issue":"1","key":"9694_CR39","first-page":"42","volume":"30","author":"SH Teng","year":"1999","unstructured":"Teng SH (1999) Low energy and mutually distant sampling. J Algorithms 30(1):42\u201367","journal-title":"J Algorithms"},{"key":"9694_CR40","doi-asserted-by":"crossref","unstructured":"Vetta A (2002) Nash equilibria in competitive societies, with applications to facility location, traffic routing and auctions. In: Proceedings of the 43th symposium on foundations of computer science (FOCS). IEEE Computer Society, New York, pp 416","DOI":"10.1109\/SFCS.2002.1181966"},{"key":"9694_CR41","doi-asserted-by":"crossref","unstructured":"Yu G, Zhang G (2008) Bin packing of selfish items. In: Proceedings of the 4th international workshop on internet and network economics (WINE). LNCS 5385. Springer, New York, pp 446\u2013453","DOI":"10.1007\/978-3-540-92185-1_50"},{"key":"9694_CR42","doi-asserted-by":"crossref","unstructured":"Zhao Y, Chen W, Teng SH (2009) The isolation game: a game of distances. Theor Comput Sci 410 (47\u201349):4905\u20134919","DOI":"10.1016\/j.tcs.2009.06.036"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-013-9694-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-013-9694-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-013-9694-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,8]],"date-time":"2023-07-08T23:01:39Z","timestamp":1688857299000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-013-9694-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,12,13]]},"references-count":42,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2015,1]]}},"alternative-id":["9694"],"URL":"https:\/\/doi.org\/10.1007\/s10878-013-9694-9","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,12,13]]}}}