Study of a Combinatorial Game in Graphs Through Linear Programming - Graphes, Algorithmes et Combinatoire Access content directly
Journal Articles Algorithmica Year : 2020

Study of a Combinatorial Game in Graphs Through Linear Programming

Abstract

In the Spy game played on a graph G, a single spy travels the vertices of G at speed s, while multiple slow guards strive to have, at all times, one of them within distance d of that spy. In order to determine the smallest number of guards necessary for this task, we analyze the game through a Linear Programming formulation and the fractional strategies it yields for the guards. We then show the equivalence of fractional and integral strategies in trees. This allows us to design a polynomial-time algorithm for computing an optimal strategy in this class of graphs. Using duality in Linear Programming, we also provide non-trivial bounds on the fractional guard-number of grids and tori, which gives a lower bound for the integral guard-number in these graphs. We believe that the approach using fractional relaxation and Linear Programming is promising to obtain new results in the field of combinatorial games.
Fichier principal
Vignette du fichier
spygame_trees_grids_July18.pdf (648.64 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01881473 , version 1 (10-10-2018)

Identifiers

Cite

Nathann Cohen, Fionn Mc Inerney, Nicolas Nisse, Stéphane Pérennes. Study of a Combinatorial Game in Graphs Through Linear Programming. Algorithmica, 2020, 82 (2), pp.212-244. ⟨10.1007/s00453-018-0503-9⟩. ⟨hal-01881473⟩
548 View
204 Download

Altmetric

Share

Gmail Facebook X LinkedIn More