SearcharxivSearch

arXiv subjects

Thomas Byrne

Publications and source records attributed to Thomas Byrne.

2 recordsLinked to original sources

The Stackelberg Game: responses to regular strategies

Following the solution to the One-Round Voronoi Game in arXiv:2011.13275, we naturally may want to consider similar games based upon the competitive locating of points and subsequent dividing of territories. In order to appease the tears of White (the first player) after they have potentially been tricked into going first in a game of point-placement, an alternative game (or rather, an extension of the Voronoi game) is the Stackelberg game where all is not lost if Black (the second player) gains over half of the contested area. It turns out that plenty of results can be transferred from One-Round Voronoi Game and what remains to be explored for the Stackelberg game is how best White can mitigate the damage of Black's placements. Since significant weaknesses in certain arrangements were outlined in arXiv:2011.13275, we shall first consider arrangements that still satisfy these results (namely, White plays a certain grid arrangement) and then explore how Black can best exploit these positions.

cs.CG

Competitive Location Problems: Balanced Facility Location and the One-Round Manhattan Voronoi Game

We study competitive location problems in a continuous setting, in which facilities have to be placed in a rectangular domain $R$ of normalized dimensions of $1$ and $ρ\geq 1$, and distances are measured according to the Manhattan metric. We show that the family of 'balanced' facility configurations (in which the Voronoi cells of individual facilities are equalized with respect to a number of geometric properties) is considerably richer in this metric than for Euclidean distances. Our main result considers the 'One-Round Voronoi Game' with Manhattan distances, in which first player White and then player Black each place $n$ points in $R$; each player scores the area for which one of its facilities is closer than the facilities of the opponent. We give a tight characterization: White has a winning strategy if and only if $ρ\geq n$; for all other cases, we present a winning strategy for Black.

cs.CG