Abstract
The one-round discrete Voronoi game, with respect to a n-point user set \(\mathcal {U}\), consists of two players Player 1 (P1) and Player 2 (P2). At first, P1 chooses a set \(\mathcal{F}_{1}\) of m facilities following which P2 chooses another set \(\mathcal{F}_{2}\) of m facilities, disjoint from \(\mathcal{F}_{1}\), where m(=O(1)) is a positive constant. The payoff of P2 is defined as the cardinality of the set of points in \(\mathcal{U}\) which are closer to a facility in \(\mathcal{F}_{2}\) than to every facility in \(\mathcal{F}_{1}\), and the payoff of P1 is the difference between the number of users in \(\mathcal{U}\) and the payoff of P2. The objective of both the players in the game is to maximize their respective payoffs. In this paper, we address the case where the points in \(\mathcal{U}\) are located along a line. We show that if the sorted order of the points in \(\mathcal{U}\) along the line is known, then the optimal strategy of P2, given any placement of facilities by P1, can be computed in O(n) time. We then prove that for m≥2 the optimal strategy of P1 in the one-round discrete Voronoi game, with the users on a line, can be computed in \(O(n^{m-\lambda_{m}})\) time, where 0<λ m <1, is a constant depending only on m.



Similar content being viewed by others
References
Ahn H-K, Cheng S-W, Cheong O, Golin M, van Oostrum R (2004) Competitive facility location: the Voronoi game. Theor Comput Sci 310:457–467
Bhattacharya BB (2010) Maximizing Voronoi regions of a set of points enclosed in a circle with applications to facility location. J Math Model Algorithms 9(4):375–392
Bhattacharya BB, Nandy SC (2010) New variations of the reverse facility location problem. In: Proc 22nd Canadian conference on computational geometry, pp 241–244
Cabello S, Miguel Diáz-Báñez J, Langerman S, Seara C, Ventura I (2010) Facility location problems in the plane based on reverse nearest neighbor queries. Eur J Oper Res 202(1):99–106
Cheong O, Efrat A, Har-Peled S (2007) On finding a guard that sees most and a shop that sells most. Discrete Comput Geom 37:545–563
Cheong O, Har-Peled S, Linial N, Matouŝek J (2004) The one-round Voronoi game. Discrete Comput Geom 31(1):125–138
Dehne F, Klein R, Seidel R (2005) Maximizing a Voronoi region: the convex case. Int J Comput Geom Appl 15:463–475
Drezner Z, Hamacher HW (eds) (2002) Facility location: applications and theory. Springer, Berlin
Eiselt HA, Laporte G (1989) Competitive spatial models. Eur J Oper Res 39:231–242
Eiselt HA, Laporte G, Thisse JF (1993) Competitive location models: a framework and bibliography. Transp Sci 27:44–54
Fekete SP, Meijer H (2005) The one-round Voronoi game replayed. Comput Geom Theory Appl 30(2):81–94
Spoerhase J, Wirth H-C (2009) (r,p)-centroid problems on paths and trees. Theor Comput Sci 410(47–49):5128–5137
Tobin R, Friesz T, Miller T (1989) Existence theory for spatially competitive network facility location models. Ann Oper Res 18:267–276
Acknowledgements
The authors wish to thank anonymous referees for valuable comments which improved the presentation of the paper.
Author information
Authors and Affiliations
Corresponding author
Additional information
A preliminary version of this paper has appeared in the Proc. 17th Annual International Computing and Combinatorics Conference (COCOON), 2011, 213–224.
Rights and permissions
About this article
Cite this article
Banik, A., Bhattacharya, B.B. & Das, S. Optimal strategies for the one-round discrete Voronoi game on a line. J Comb Optim 26, 655–669 (2013). https://doi.org/10.1007/s10878-011-9447-6
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10878-011-9447-6