Further results on the Hunters and Rabbit game through monotonicity - Laboratoire d'Informatique, Signaux et Systèmes de Sophia-Antipolis Accéder directement au contenu
Rapport Année : 2023

Further results on the Hunters and Rabbit game through monotonicity

Résumé

The Hunters and Rabbit game is played on a graph G where the Hunter player shoots at k vertices in every round while the Rabbit player occupies an unknown vertex and, if it is not shot, must move to a neighbouring vertex after each round. The Rabbit player wins if he can ensure that its position is never shot. The Hunter player wins otherwise. The hunter number h(G) of a graph G is the minimum integer k such that the Hunter player has a winning strategy (i.e., allowing him to win whatever be the strategy of the Rabbit player). This game has been studied in several graph classes, in particular in bipartite graphs (grids, trees, hypercubes...), but the computational complexity of computing h(G) remains open in general graphs and even in more restricted graph classes such as trees. To progress further in this study, we propose a notion of monotonicity (a well-studied and useful property in classical pursuit-evasion games such as graph searching games) for the Hunters and Rabbit game imposing that, roughly, a vertex that has already been shot "must not host the rabbit anymore". This allows us to obtain new results in various graph classes. More precisely, let the monotone hunter number mh(G) of a graph G be the minimum integer k such that the Hunter player has a monotone winning strategy. We show that pw(G) ≤ mh(G) ≤ pw(G) + 1 for any graph G with pathwidth pw(G), which implies that, unless P = NP, there does not exist a polynomial-time algorithm for computing mh(G). Then, we show that mh(G) can be computed in polynomial time in split graphs, interval graphs, cographs and trees. These results go through structural characterizations which allow us to relate the monotone hunter number with the pathwidth in some of these graph classes. In all cases, this allows us to specify the hunter number or to show that there may be an arbitrary gap between h and mh, i.e., that monotonicity does not help. In particular, we show that, for every k ≥ 3, there exists a tree T with h(T) = 2 and mh(T) = k. We conclude by proving that computing h (resp., mh) is FPTparameterized by the minimum size of a vertex cover.
Fichier principal
Vignette du fichier
HunterXRabbit-19.pdf (679.56 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03995642 , version 1 (18-02-2023)
hal-03995642 , version 2 (28-02-2023)
hal-03995642 , version 3 (05-05-2023)

Identifiants

  • HAL Id : hal-03995642 , version 3

Citer

Thomas Dissaux, Foivos Fioravantes, Harmender Galhawat, Nicolas Nisse. Further results on the Hunters and Rabbit game through monotonicity. Inria - Sophia Antipolis. 2023. ⟨hal-03995642v3⟩
128 Consultations
93 Téléchargements

Partager

Gmail Facebook X LinkedIn More