Skip to Main content Skip to Navigation

Spy-Game on graphs: complexity and simple topologies

Abstract : We define and study the following two-player game on a graph G. Let k ∈ N *. A set of k guards is occupying some vertices of G while one spy is standing at some node. At each turn, first the spy may move along at most s edges, where s ∈ N * is his speed. Then, each guard may move along one edge. The spy and the guards may occupy the same vertices. The spy has to escape the surveillance of the guards, i.e., must reach a vertex at distance more than d ∈ N (a predefined distance) from every guard. Can the spy win against k guards? Similarly, what is the minimum distance d such that k guards may ensure that at least one of them remains at distance at most d from the spy? This game generalizes two well-studied games: Cops and robber games (when s = 1) and Eternal Dominating Set (when s is unbounded). We consider the computational complexity of the problem, showing that it is NP-hard (for every speed s and distance d) and that some variant of it is PSPACE-hard in DAGs. Then, we establish tight tradeoffs between the number of guards, the speed s of the spy and the required distance d when G is a path or a cycle.
Complete list of metadatas

Cited literature [18 references]  Display  Hide  Download
Contributor : Nicolas Nisse <>
Submitted on : Thursday, February 9, 2017 - 2:48:30 PM
Last modification on : Wednesday, April 8, 2020 - 3:55:45 PM
Document(s) archivé(s) le : Wednesday, May 10, 2017 - 2:24:36 PM


Files produced by the author(s)


  • HAL Id : hal-01463297, version 1


Nathann Cohen, Nícolas Martins, Fionn Mc Inerney, Nicolas Nisse, Stéphane Pérennes, et al.. Spy-Game on graphs: complexity and simple topologies. [Research Report] Inria Sophia Antipolis. 2017. ⟨hal-01463297⟩



Record views


Files downloads