Existence theory for spatially competitive network facility location models
Annals of Operations Research
Journal of the ACM (JACM)
On the continuous Weber and k-median problems (extended abstract)
Proceedings of the sixteenth 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: the Voronoi game
Theoretical Computer Science
On finding a guard that sees most and a shop that sells most
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
The isolation game: A game of distances
Theoretical Computer Science
| Hi-index | 0.00 |
We consider the one-round Voronoi game, where the first player ("White", called "Wilma") places a set of n points in a rectangular area of aspect ratio ρ ≤ 1, followed by the second player ("Black", called "Barney"), who places the same number of points. Each player wins the fraction of the board closest to one of his points, and the goal is to win more than half of the total area. This problem has been studied by Cheong et al. who showed that for large enough n and ρ = 1, Barney has a strategy that guarantees a fraction of 1/2 + α for some small fixed α.We resolve a number of open problems raised by that paper. In particular, we give a precise characterization of the outcome of the game for optimal play: we show that Barney has a winning strategy for n ≥ 3 and ρ √2/n, and for n = 2 and ρ √3/2. Wilma wins in all remaining cases, i.e., for n ≥ 3 and ρ ≤ √2/n, for n = 2 and ρ ≤ √3/2, and for n = 1. We also discuss complexity aspects of the game on more general boards, by proving that for a polygon with holes, it is NP-hard to maximize the area Barney can win against a given set of points by Wilma.