Study of a combinatorial game in graphs through Linear Programming - Archive ouverte HAL Accéder directement au contenu
Rapport (Rapport De Recherche) Année : 2017

Study of a combinatorial game in graphs through Linear Programming

Résumé

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 torus 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
GridsTreesafterISAAC2017.pdf (610.24 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01462890 , version 1 (09-02-2017)
hal-01462890 , version 2 (05-09-2017)

Identifiants

  • HAL Id : hal-01462890 , version 2

Citer

Nathann Cohen, Fionn Mc Inerney, Nicolas Nisse, Stéphane Pérennes. Study of a combinatorial game in graphs through Linear Programming. [Research Report] Inria Sophia Antipolis. 2017. ⟨hal-01462890v2⟩
587 Consultations
406 Téléchargements

Partager

Gmail Facebook X LinkedIn More