Computational geometry: an introduction
Computational geometry: an introduction
Existence theory for spatially competitive network facility location models
Annals of Operations Research
Market and locational equilibrium for two competitors
Operations Research
ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
Maximizing a Voronoi Region: The Convex Case
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
Maximum Neighbour Voronoi Games
WALCOM '09 Proceedings of the 3rd International Workshop on Algorithms and Computation
Journal of Mathematical Modelling and Algorithms
Social Network Analysis and Mining for Business Applications
ACM Transactions on Intelligent Systems and Technology (TIST)
Search algorithm to find optimum strategies to shape political action with subjective assessment
ECS'10/ECCTD'10/ECCOM'10/ECCS'10 Proceedings of the European conference of systems, and European conference of circuits technology and devices, and European conference of communications, and European conference on Computer science
Min-Max payoffs in a two-player location game
Operations Research Letters
| Hi-index | 0.00 |
We consider a competitive facility location problem with two players.Pla yers 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.W e present a winning strategy for the second player, where the arena is a circle or a line segment.