Voronoi game is a geometric model of competitive facility location problem played between
two players. Users are generally modeled as points uniformly distributed on a given …

To address the dynamic nature of real-world networks, we generalize competitive diffusion
games and Voronoi games from static to temporal graphs, where edges may appear or …

Let $ V $ be a multiset of $ n $ points in $\mathbb {R}^ d $, which we call voters, and let $
k\geq 1$ and $\ell\geq 1$ be two given constants. We consider the following game, where …

In this paper we study the last round of the discrete Voronoi game in R 2, a problem which is
also of independent interest in competitive facility location. The game consists of two players …

The one-round discrete Voronoi game, with respect to an n-point user set U, consists of two
players Player 1 (P 1) and Player 2 (P 2). At first, P 1 chooses a set of facilities F 1 following …

Basing on the two-player Voronoi game introduced by Ahn et al.[1] and the multi-player
diffusion game introduced by Alon et al.[2], we investigate the following one-round multi …

We study the performance of subgame perfect equilibria, a solution concept which better
captures the players' rationality in sequential games with respect to the classical myopic …

Consider a scenario in which several agents are located in the Euclidean space, and the
agents want to create a network in which everyone has fast access to all or some other …

In this paper we consider a simplified variant of the discrete Voronoi Game in R2, which is
also of independent interest in competitive facility location. The game consists of two players …

Let P be a simple polygon with m vertices and let U be a set of n points in P. We consider the
points of U to be “users”. We consider a game with two players P_1 and P_2. In this game …