Cookies?
Library Header Image
LSE Research Online LSE Library Services

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

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

[img] Text - Accepted Version
Repository staff only until 6 September 2020.

Download (657kB) | Request a copy

Identification Number: 10.1016/j.ejor.2018.08.050

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
Sets: Departments > Mathematics
Date Deposited: 07 Sep 2018 14:57
Last Modified: 20 Oct 2019 00:18
URI: http://eprints.lse.ac.uk/id/eprint/90191

Actions (login required)

View Item View Item

Downloads

Downloads per month over past year

View more statistics