Patrolling games

Tools

Alpern, Steve and Morton, Alec and Papadaki, Katerina (2011) Patrolling games. Operations Research, 59 (5). pp. 1246-1257. ISSN 0030-364X (https://doi.org/10.1287/opre.1110.0983)

Full text not available in this repository.Request a copy

Abstract

A key operational problem for those charged with the security of vulnerable facilities (such as airports or art galleries) is the scheduling and deployment of patrols. Motivated by the problem of optimizing randomized, and thus unpredictable, patrols, we present a class of patrolling games. The facility to be patrolled can be thought of as a network or graph Q of interconnected nodes (e.g., rooms, terminals), and the Attacker can choose to attack any node of Q within a given time T. He requires m consecutive periods there, uninterrupted by the Patroller, to commit his nefarious act (and win). The Patroller can follow any path on the graph. Thus, the patrolling game is a win-lose game, where the Value is the probability that the Patroller successfully intercepts an attack, given best play on both sides. We determine analytically either the Value of the game, or bounds on the Value, for various classes of graphs, and we discuss possible extensions and generalizations.

ORCID iDs

Alpern, Steve, Morton, Alec ORCID logoORCID: https://orcid.org/0000-0003-3803-8517 and Papadaki, Katerina;
CORE (COnnecting REpositories)