Skip to content Skip to navigation
University of Warwick
  • Study
  • |
  • Research
  • |
  • Business
  • |
  • Alumni
  • |
  • News
  • |
  • About

University of Warwick
Publications service & WRAP

Highlight your research

  • WRAP
    • Home
    • Search WRAP
    • Browse by Warwick Author
    • Browse WRAP by Year
    • Browse WRAP by Subject
    • Browse WRAP by Department
    • Browse WRAP by Funder
    • Browse Theses by Department
  • Publications Service
    • Home
    • Search Publications Service
    • Browse by Warwick Author
    • Browse Publications service by Year
    • Browse Publications service by Subject
    • Browse Publications service by Department
    • Browse Publications service by Funder
  • Help & Advice
University of Warwick

The Library

  • Login
  • Admin

Continuous patrolling games

Tools
- Tools
+ Tools

Alpern, Steve, Bui, Thuy, Lidbetter, Thomas and Papadaki, Katerina (2022) Continuous patrolling games. Operations Research . doi:10.1287/opre.2022.2346 ISSN 0030-364X. (In Press)

[img]
Preview
PDF
WRAP-Continuous-patrolling-games-2022.pdf - Accepted Version - Requires a PDF viewer.

Download (1019Kb) | Preview
[img]
Preview
PDF
WRAP-Continuous-patrolling-appendix-revision-2022.pdf - Unspecified Version - Requires a PDF viewer.

Download (305Kb) | Preview
Official URL: https://doi.org/10.1287/opre.2022.2346

Request Changes to record.

Abstract

We study a patrolling game played on a network Q, considered as a metric space. The Attacker chooses a point of Q (not necessarily a node) to attack during a chosen time interval of fixed duration. The Patroller chooses a unit speed path on Q and intercepts the attack (and wins) if she visits the attacked point during the attack time interval. This zero-sum game models the problem of protecting roads or pipelines from an adversarial attack. The payoff to the maximizing Patroller is the probability that the attack is intercepted. Our results include the following: (i) a solution to the game for any network Q, as long as the time required to carry out the attack is sufficintly short, (ii) a solution to the game for all tree networks that satisfy a certain condition on their extremities, and (iii) a solution to the game for any attack duration for stars with one long arc and the remaining arcs equal in length. We present a conjecture on the solution of the game
for arbitrary trees and establish it in certain cases.

Item Type: Journal Article
Subjects: Q Science > QR Microbiology
Divisions: Faculty of Science, Engineering and Medicine > Science > Mathematics
Journal or Publication Title: Operations Research
Publisher: Institute for Operations Research and the Management Sciences (I N F O R M S)
ISSN: 0030-364X
Official Date: 2022
Dates:
DateEvent
2022Published
2 September 2022Available
31 May 2022Accepted
DOI: 10.1287/opre.2022.2346
Status: Peer Reviewed
Publication Status: In Press
Access rights to Published version: Restricted or Subscription Access
Copyright Holders: Copyright © 2022, INFORMS
Date of first compliant deposit: 14 November 2022
Date of first compliant Open Access: 14 November 2022
Related URLs:
  • Publisher

Request changes or add full text files to a record

Repository staff actions (login required)

View Item View Item

Downloads

Downloads per month over past year

View more statistics

twitter

Email us: wrap@warwick.ac.uk
Contact Details
About Us