Skip to Main content Skip to Navigation
Journal articles

A probabilistic version of the game of Zombies and Survivors on graphs

Abstract : We consider a new probabilistic graph searching game played on graphs, inspired by the familiar game of Cops and Robbers. In Zombies and Survivors, a set of zombies attempts to eat a lone survivor loose on a given graph. The zombies randomly choose their initial location, and during the course of the game, move directly toward the survivor. At each round, they move to the neighbouring vertex that minimizes the distance to the survivor; if there is more than one such vertex, then they choose one uniformly at random. The survivor attempts to escape from the zombies by moving to a neighbouring vertex or staying on his current vertex. The zombies win if eventually one of them eats the survivor by landing on their vertex; otherwise, the survivor wins. The zombie number of a graph is the minimum number of zombies needed to play such that the probability that they win is at least 1/2. We present asymptotic results for the zombie numbers of several graph families, such as cycles, hypercubes, incidence graphs of projective planes, and Cartesian and toroidal grids.
Document type :
Journal articles
Complete list of metadata

Cited literature [27 references]  Display  Hide  Download

https://hal.inria.fr/hal-01291964
Contributor : Dieter Mitsche <>
Submitted on : Tuesday, March 22, 2016 - 12:58:37 PM
Last modification on : Friday, January 8, 2021 - 11:22:05 AM
Long-term archiving on: : Sunday, November 13, 2016 - 10:41:30 PM

File

zombies.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Anthony Bonato, Dieter Mitsche, Xavier Pérez-Giménez, Pawel Pralat. A probabilistic version of the game of Zombies and Survivors on graphs. Theoretical Computer Science, Elsevier, 2015, ⟨10.1016/j.tcs.2015.12.012⟩. ⟨hal-01291964⟩

Share

Metrics

Record views

136

Files downloads

231