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

author

Abstract:

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 largest arena is the winner. In this paper, the one-round weighted Voronoi game is considered in both one and two dimensional regions. In the weighed Voronoi game, the clients can also consider the quality of the facilities in addition to the distance to choose a facility. Accordingly, in one dimension, we will study two different models of facilities  and we will show that Black has a winning strategy in the one-round weighted Voronoi game.  

Upgrade to premium to download articles

Sign up to access the full text

Already have an account?login

similar resources

Competitive facility location: the Voronoi game

We consider a competitive facility location problem with two players. Players alternate placing points, one at a time, into the playing arena, until each of them has placed n points. The arena is then subdivided according to the nearest-neighbor rule, and the player whose points control the larger area wins. We present a winning strategy for the second player, where the arena is a circle or a l...

full text

The One-Round Voronoi Game Replayed

We consider the one-round Voronoi game, where the first player (“White”, called “Wilma”) places a set of n points in a rectangular area of aspect ratio ρ ≤ 1, followed by the second player (“Black”, called “Barney”), who places the same number of points. Each player wins the fraction of A closest to one of his points, and the goal is to win more than half of the total area. This problem has bee...

full text

Subquadratic algorithms for the weighted maximin facility location problem

Let S be a set of n points in the plane, and let each point p of S have a positive weight w(p). We consider the problem of positioning a point x inside a compact region R ⊆ R such that min{ w(p)−1 · d(x, p) ; p ∈ S } is maximized. Based on the parametric search paradigm, we give the first subquadratic algorithms for this problem, with running time O(n log n). Furthermore, we shall introduce the...

full text

Optimal Strategies for the One-Round Discrete Voronoi Game on a Line

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 F1 of m facilities following which P2 chooses another set F2 of m facilities, disjoint from F1, where m(= O(1)) is a positive constant. The payoff of P2 is defined as the cardinality of the set of points in U which are closer to a facili...

full text

The Discrete One-round Voronoi Game: Optimizing the First Player Strategy by Integer Programming

The discrete Voronoi game is a mathematical model for the competitive facility location problem with two players where each one must place a total of p facilities on a graph. Each node on the graph is an applicant facility of either player or a customer. Each customer is dominated by the player who owns the nearest placed facility generating a profit for the player who dominates it. Each player...

full text

The Maximum Facility Location Problem

In the maximum facility location problem, we are given a set of clients C and facilities F . Assigning a client u to a facility v incurs a cost w uv and each facility has an associated interval I v on the real line. Our goal is to assign as many clients to open facilities in order to maximise the cost of assignment, subject to the constraint that open facilities cannot have their respective int...

full text

My Resources

Save resource for easier access later

Save to my library Already added to my library

{@ msg_add @}


Journal title

volume 6  issue 1

pages  0- 0

publication date 2020-07

By following a journal you will be notified via email when a new issue of this journal is published.

Keywords

No Keywords

Hosted on Doprax cloud platform doprax.com

copyright © 2015-2023