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
Maximum Neighbour Voronoi Games
WALCOM '09 Proceedings of the 3rd International Workshop on Algorithms and Computation
On the Performances of Nash Equilibria in Isolation Games
COCOON '09 Proceedings of the 15th Annual International Conference on Computing and Combinatorics
Nash equilibria in Voronoi games on graphs
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Optimal strategies for the one-round discrete Voronoi game on a line
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
On the performances of Nash equilibria in isolation games
Journal of Combinatorial Optimization
Optimal strategies for the one-round discrete Voronoi game on a line
Journal of Combinatorial Optimization
| 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 @r==3 and @r2/n, and for n=2 and @r3/2. Wilma wins in all remaining cases, i.e., for n=3 and @r=