Proceedings of the eighteenth annual symposium on Computational geometry
Maximizing a Voronoi Region: The Convex Case
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
Competitive Facility Location along a Highway
COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
Competitive facility location: the Voronoi game
Theoretical Computer Science
Finding a Guard that Sees Most and a Shop that Sells Most
Discrete & Computational Geometry
Tight Bounds on Maximal and Maximum Matchings
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
The one-round Voronoi game replayed
Computational Geometry: Theory and Applications - Special issue on the 19th European workshop on computational geometry - EuroCG 03
| Hi-index | 0.00 |
Recently several researchers have studied the competitive facility location problem in the form of Voronoi games, where each of the two players places n points with the target of maximizing total Voronoi area of its sites in the Voronoi diagram of 2n points. In this paper we address this problem by introducing Voronoi games by neighbours where the basic objective of an optimal playing strategy is to acquire more neighbors than the opponent. We consider several variations of this game, and for each variation we either give a winning strategy, if it exists, or show how the game ends in a tie.