Optimizing periodic patrols against short attacks on the line and other networks

Alpern, Steve, Lidbetter, Thomas and Papadaki, Katerina ORCID: 0000-0002-0755-1281 (2018) Optimizing periodic patrols against short attacks on the line and other networks. European Journal of Operational Research. ISSN 0377-2217

Preview

Text - Accepted Version Download (657kB) | Preview

• Author

Abstract

On a given network, a Patroller and Attacker play the following win-lose game: The Patroller adopts a periodic walk on the network while the Attacker chooses a node and two consecutive periods (to attack there). The Patroller wins if he successfully intercepts the attack, that is, if he occupies the attacked node in one of the two periods of the attack. We solve this game in mixed strategies for line graphs, the first class of graphs to be solved for the periodic patrolling game. We also solve the game for arbitrary graphs when the period is even.

Item Type:	Article
Official URL:	https://www.journals.elsevier.com/european-journal...
Additional Information:	© 2018 Elsevier B.V.
Divisions:	Mathematics
Subjects:	Q Science > QA Mathematics
Date Deposited:	07 Sep 2018 14:57
Last Modified:	11 Dec 2024 21:42
URI:	http://eprints.lse.ac.uk/id/eprint/90191

Actions (login required)

View Item