In the one-round Voronoi game, the first player chooses an n-point set W in a square Q, and then the second player places another n-point set B into Q. The payoff for the second player is the fraction of the area of Q occupied by the regions of the points of B in the Voronoi diagram of W \cup B. We give a (randomized) strategy for the second player that always guarantees him a payoff of at least ½ + α, for a constant α > 0 and every large enough n. This contrasts with the one-dimensional situation, with Q=[0,1], where the first player can always win more than ½.
About this article
Cite this article
Cheong, O., Har-Peled, S., Linial, N. et al. The One-Round Voronoi Game. Discrete Comput Geom 31, 125–138 (2004). https://doi.org/10.1007/s00454-003-2951-4
- Voronoi Diagram