Competitive facility location: the Voronoi game

Cited 65 time in webofscience Cited 91 time in scopus
  • Hit : 345
  • Download : 0
We consider a competitive facility location problem with two players. Players alternate placing points, one at a time, into the playing arena, until each of them has placed n points. The arena is then subdivided according to the nearest-neighbor rule, and the player whose points control the larger area wins. We present a winning strategy for the second player, where the arena is a circle or a line segment. We permit variations where players can play more than one point at a time, and show that the first player can ensure that the second player wins by an arbitrarily small margin. (C) 2003 Elsevier B.V. All rights reserved.
Publisher
ELSEVIER SCIENCE BV
Issue Date
2004-01
Language
English
Article Type
Article
Keywords

EQUILIBRIUM; EXISTENCE; MODELS

Citation

THEORETICAL COMPUTER SCIENCE, v.310, no.1-3, pp.457 - 467

ISSN
0304-3975
DOI
10.1016/j.tcs.2003.09.004
URI
http://hdl.handle.net/10203/82741
Appears in Collection
CS-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 65 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0