查看文章

The one-round discrete Voronoi game, with respect to a n-point user set , consists of two players Player 1 (P1) and Player 2 (P2). At first, P1 chooses a set of m facilities following which P2 chooses another set of m facilities, disjoint from , where m(=O(1)) is a positive constant. The payoff of P2 is defined as the cardinality of the set of points in which are closer to a facility in than to every facility in , and the payoff of P1 is the difference between the number of users in 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 are located along a line. We show that if the sorted order of the points in 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 …