{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:18:29Z","timestamp":1759637909849},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2010,2,19]],"date-time":"2010-02-19T00:00:00Z","timestamp":1266537600000},"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":[[2011,10]]},"DOI":"10.1007\/s10878-010-9300-3","type":"journal-article","created":{"date-parts":[[2010,2,18]],"date-time":"2010-02-18T15:40:43Z","timestamp":1266507643000},"page":"378-391","source":"Crossref","is-referenced-by-count":5,"title":["On the performances of Nash equilibria in isolation games"],"prefix":"10.1007","volume":"22","author":[{"given":"Vittorio","family":"Bil\u00f2","sequence":"first","affiliation":[]},{"given":"Michele","family":"Flammini","sequence":"additional","affiliation":[]},{"given":"Gianpiero","family":"Monaco","sequence":"additional","affiliation":[]},{"given":"Luca","family":"Moscardelli","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,2,19]]},"reference":[{"issue":"1\u20133","key":"9300_CR1","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1016\/j.tcs.2003.09.004","volume":"310","author":"HK Ahn","year":"2004","unstructured":"Ahn HK, Cheng SW, Cheong O, Golin MJ, Oostrum R (2004) Competitive facility location: the Voronoi game. Theor Comput Sci 310(1\u20133):457\u2013467","journal-title":"Theor Comput Sci"},{"key":"9300_CR2","first-page":"511","volume-title":"Proc\u00a0of the 35th annual ACM symposium on theory of computing (STOC)","author":"E Anshelevich","year":"2003","unstructured":"Anshelevich E, Dasgupta A, Tardos E, Wexler T (2003) Near-optimal network design with selfish agents. In: Proc\u00a0of the 35th annual ACM symposium on theory of computing (STOC). ACM, New York, pp\u00a0511\u2013520"},{"key":"9300_CR3","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. Discrete Comput Geom 31:125\u2013138","journal-title":"Discrete Comput Geom"},{"key":"9300_CR4","series-title":"LNCS","first-page":"17","volume-title":"Proc\u00a0of the 15th annual European symposium on algorithms (ESA)","author":"C D\u00fcrr","year":"2007","unstructured":"D\u00fcrr C, Thang NK (2007) Nash equilibria in Voronoi games on graphs. In: Proc\u00a0of the 15th annual European symposium on algorithms (ESA). LNCS, vol 4698. Springer, Berlin, pp 17\u201328"},{"issue":"129","key":"9300_CR5","doi-asserted-by":"crossref","first-page":"27","DOI":"10.2307\/2296817","volume":"42","author":"BC Eaton","year":"1975","unstructured":"Eaton BC, Lipsey RG (1975) The principle of minimum differentiation reconsidered: Some new developments in the theory of spatial competition. Rev Econ Stud 42(129):27\u201349","journal-title":"Rev Econ Stud"},{"issue":"1","key":"9300_CR6","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"},{"key":"9300_CR7","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/j.comgeo.2004.05.005","volume":"30","author":"SP Fekete","year":"2005","unstructured":"Fekete SP, Meijer H (2005) The one-round Voronoi game replayed. Comput Geom Theory Appl 30:81\u201394","journal-title":"Comput Geom Theory Appl"},{"issue":"153","key":"9300_CR8","first-page":"41","volume":"39","author":"H Hotelling","year":"1929","unstructured":"Hotelling H (1929) Stability in competition. Comput Geom Theory Appl 39(153):41\u201357","journal-title":"Comput Geom Theory Appl"},{"key":"9300_CR9","doi-asserted-by":"crossref","unstructured":"Jain AK, Murty MN, Flynn PJ (1999) Data clustering: a review. ACM Comput Surv 31(3)","DOI":"10.1145\/331499.331504"},{"key":"9300_CR10","series-title":"LNCS","first-page":"404","volume-title":"Proc of the 16th international symposium on theoretical aspects of computer science (STACS)","author":"E Koutsoupias","year":"1999","unstructured":"Koutsoupias E, Papadimitriou CH (1999) Worst-case equilibria. In: Proc of the 16th international symposium on theoretical aspects of computer science (STACS). LNCS, vol 1653. Springer, Berlin, pp\u00a0404\u2013413"},{"key":"9300_CR11","series-title":"LNCS","first-page":"503","volume-title":"Proc. of the 33rd international symposium on mathematical foundations of computer science (MFCS)","author":"M Mavronicolas","year":"2008","unstructured":"Mavronicolas M, Monien B, Papadopoulou VG, Schoppmann F (2008) Voronoi games on cycle graphs. In: Proc. of the 33rd international symposium on mathematical foundations of computer science (MFCS). LNCS, vol 5162. Springer, Berlin, pp 503\u2013514"},{"key":"9300_CR12","doi-asserted-by":"crossref","unstructured":"Nash J (1950) Equilibrium points in n-person games. In: Proc of the national academy of sciences, vol\u00a036, pp\u00a048\u201349","DOI":"10.1073\/pnas.36.1.48"},{"issue":"1","key":"9300_CR13","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":"9300_CR14","series-title":"LNCS","first-page":"148","volume-title":"Proc of the 19th international symposium on algorithms and computation (ISAAC)","author":"Y Zhao","year":"2008","unstructured":"Zhao Y, Chen W, Teng SH (2008) The isolation game: A game of distances. In: Proc of the 19th international symposium on algorithms and computation (ISAAC). LNCS, vol 5369. Springer, Berlin, pp\u00a0148\u2013159"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-010-9300-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-010-9300-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-010-9300-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T00:18:15Z","timestamp":1559261895000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-010-9300-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,2,19]]},"references-count":14,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2011,10]]}},"alternative-id":["9300"],"URL":"https:\/\/doi.org\/10.1007\/s10878-010-9300-3","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,2,19]]}}}