Skip to main content
Article thumbnail
Location of Repository

Optimizing randomized patrols

By Steven Alpern, Alec Morton and Katerina Papadaki


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 on graphs. The facility can be thought of as a 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 optimal (minimax) patrolling strategies for various classes of graphs, and discuss how our results could support decisions about hardening facilities or changing the topology of the terrain to be patrolled

Topics: U Military Science (General), QA Mathematics
Publisher: Operational Research Group, London School of Economics and Political Science
Year: 2009
OAI identifier:
Provided by: LSE Research Online

Suggested articles


  1. (1978). An algorithm for deploying a crime directed (tactical) patrol force. doi
  2. (2007). An e¢cient heuristic approach for security against multiple adversaries. AAMAS ’07, doi
  3. (1991). An in…ltration game on k arcs. doi
  4. (2000). Art gallery and illumination problems. doi
  5. (2009). Azaiez (eds) doi
  6. (1970). Contributions to a theory of patrol scheduling. doi
  7. (2006). Defending Critical Infrastructure". doi
  8. (1971). Graph theory. doi
  9. (1992). In…ltration games on arbitrary graphs. doi
  10. (2002). Inspection games. Handbook of Game Theory with Economic Applications. doi
  11. (1997). On the in…ltration game. doi
  12. (2005). Partition dependence in decision analysis, resource allocation and consumer choice. Experimental Business Research. Volume doi
  13. (2002). Policing for crime prevention. In: Evidence-based crime prevention, L.Sherman et. al., eds, Routledge, Taylor and Francis, doi
  14. (2000). Search games and other applications of game theory: doi
  15. (1993). Some games of search on a lattice." doi
  16. (2007). The Element of Surprise.
  17. (2009). The in‡uence of secrecy on the communication structure of covert networks. doi
  18. (1989). The Number Hides Game." doi
  19. (1985). The Search Value of a Network." doi
  20. (2003). The Theory of Search Games and Rendezvous. doi
  21. (2003). Two-person zero-sum games, 3rd edition. doi
  22. (1972). Urban Police Patrol Analysis. doi
  23. (2007). USC student’s computer program enlisted in security e¤orts at LAX."

To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.