IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v70y2022i1p129-140.html
   My bibliography  Save this article

Adversarial Patrolling in a Uniform

Author

Listed:
  • Steve Alpern

    (Operations Group, Warwick Business School, University of Warwick, Coventry CV4 7AL, United Kingdom)

  • Paul Chleboun

    (Department of Statistics, University of Warwick, Coventry CV4 7AL, United Kingdom)

  • Stamatios Katsikas

    (Centre for Complexity Science, University of Warwick, Coventry CV4 7AL, United Kingdom; International Education Institute, University of St. Andrews, St. Andrews KY16 9DJ, United Kingdom)

  • Kyle Y. Lin

    (Operations Research Department, Naval Postgraduate School, Monterey, California 93943)

Abstract

Patrolling games were introduced by Alpern, Morton, and Papadaki in 2011 to model the adversarial problem where a mobile Patroller can thwart an attack at some location only by visiting it during the attack period, which has a prescribed integer duration. In this note, we modify the problem by allowing the Attacker to go to his planned attack location early and observe the presence or the absence there of the Patroller (who wears a uniform). To avoid being too predictable, the Patroller may sometimes remain at her base when she could have been visiting a possible attack location. The Attacker can then choose to delay attacking for some number of periods after the Patroller leaves his planned attack location. As shown here, this extra information for the Attacker can reduce thwarted attacks by as much as a factor of four in some cases. Our main finding is that the attack should begin in the second period the Patroller is away and the Patroller should never visit the same location (other than her base) in consecutive periods.

Suggested Citation

  • Steve Alpern & Paul Chleboun & Stamatios Katsikas & Kyle Y. Lin, 2022. "Adversarial Patrolling in a Uniform," Operations Research, INFORMS, vol. 70(1), pages 129-140, January.
    • Handle: RePEc:inm:oropre:v:70:y:2022:i:1:p:129-140
    DOI: 10.1287/opre.2021.2152
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.2021.2152
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.2021.2152?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:oropre:v:70:y:2022:i:1:p:129-140. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.