The discrete Voronoi game, with respect to a n-point user set U, consists of two players Player 1 (P1) and Player 2 (P2). P1 and P2 both places a set of facilities each F1 and F2 respectively. The payoff of a player i is defined as the cardinality of the set of points in U which are closer to a point in Fi than to every point in Fj , for i = j. The objective of both the players in the game is to maximize their respective payoffs. In this talk, I will address a few variant of discrete Voronoi games.