One-Round Discrete Voronoi Game in ℝ 2 in Presence of Existing Facilities.
Aritra Banik, Bhaswar B. Bhattacharya, Sandip Das, Satyaki Mukherjee · Canadian Conference on Computational Geometry · 2013
In this paper we consider a simplied variant of the discrete Voronoi Game in R 2 , which is also of independent interest in competitive facility location. The game consists of two players P1 and P2, and a nite set U of users in the plane. The players have already placed two sets of facilities F and S, respectively in the plane. The game begins by P1 placing a new facility followed by P2 placing another facility, and the objective of both the players is to maximize their own total payos. When jFj = jSj = m, this corresponds to the last round of the (m + 1)-round discrete Voronoi Game in R 2 . In this paper we propose polynomial time algorithms for obtaining optimal strategies of both the players under arbitrary locations of the existing facilitiesF andS. We show that the optimal strategy of P2, given any placement of P1, can be found inO(n 2 ) time, and the optimal strategy of P1 can be found in O(n 8 ) time.