The discrete Voronoi game in R2

نویسندگان

  • Aritra Banik
  • Bhaswar B. Bhattacharya
  • Sandip Das
  • Satyaki Mukherjee
چکیده

In this paper we study the last round of the discrete Voronoi game in R, a problem which is also of independent interest in competitive facility location. The game consists of two players P1 and P2, and a finite set U of users in the plane. The players have already placed two disjoint sets of facilities F and S, respectively in the plane. The game begins with P1 placing a new facility followed by P2 placing another facility, and the objective of both the players is to maximize their own total payoffs. In this paper we propose polynomial time algorithms for the optimal strategies of both the players under arbitrary locations of the existing facilities F and S. We show that in the L1 and the L∞ metrics, the optimal strategy of P2, given any placement of P1, can be found in O(n log n) time, and the optimal strategy of P1 can be found in O(n log n) time. In the L2 metric, the optimal strategies of P2 and P1 can be obtained in O(n ) and O(n) times, respectively.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the facility location problem: One-round weighted Voronoi game

Voronoi game presents a simple geometric model for Competitive facility location problems with two players. Voronoi game is played by two players known as White and Black, they play in a continuous arena. In the one-round game, White starts game and places all his points in the arena then Black places her points. Then the arena is divided by distance between two players and the player with the ...

متن کامل

The Voronoi game on graphs and its complexity

The Voronoi game is a two-person game which is a model for a competitive facility location. The game is played on a continuous domain, and only two special cases (one-dimensional case and one-round case) are well investigated. We introduce the discrete Voronoi game in which the game arena is given as a graph. We first analyze the game when the arena is a large complete k-ary tree, and give an o...

متن کامل

One-Round Discrete Voronoi Game in ℝ2 in Presence of Existing Facilities

In this paper we consider a simplified variant of the discrete Voronoi Game in R, which is also of independent interest in competitive facility location. The game consists of two players P1 and P2, and a finite 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 placin...

متن کامل

Anisotropic Triangulations via Discrete Riemannian Voronoi Diagrams

The construction of anisotropic triangulations is desirable for various applications, such as the numerical solving of partial differential equations and the representation of surfaces in graphics. To solve this notoriously difficult problem in a practical way, we introduce the discrete Riemannian Voronoi diagram, a discrete structure that approximates the Riemannian Voronoi diagram. This struc...

متن کامل

Discrete Voronoi games and ϵ-nets, in two and three dimensions

The one-round discrete Voronoi game, with respect to a n-point user set U , consists of two players Player 1 (P1) and Player 2 (P2). At first, P1 chooses a set of facilities F1 following which P2 chooses another set of facilities F2, disjoint from F1. The payoff of P2 is defined as the cardinality of the set of points in U which are closer to a facility in F2 than to every facility in F1, and t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Comput. Geom.

دوره 63  شماره 

صفحات  -

تاریخ انتشار 2017