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

Patrolling a Border

Author

Listed:
  • Katerina Papadaki

    (Department of Mathematics, London School of Economics, London WC2A 2AE, United Kingdom)

  • Steve Alpern

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

  • Thomas Lidbetter

    (Rutgers Business School, Department of Management Science and Information Systems, Newark, New Jersey 07102)

  • Alec Morton

    (Department of Management Science, University of Strathclyde, Glasgow G1 1XQ, United Kingdom)

Abstract

Patrolling games were recently introduced to model the problem of protecting the nodes of a network from an attack. Time is discrete and in each time unit the Patroller can stay at the same node or move to an adjacent node. The Attacker chooses when to attack and which node to attack and needs m consecutive time units to carry it out. The Attacker wins if the Patroller does not visit the chosen node while it is being attacked; otherwise, the Patroller wins. This paper studies the patrolling game where the network is a line graph of n nodes, which models the problem of guarding a channel or protecting a border from infiltration. We solve the patrolling game for any values of m and n , providing an optimal Patroller strategy, an optimal Attacker strategy, and the value of the game (optimal probability that the attack is intercepted).

Suggested Citation

  • Katerina Papadaki & Steve Alpern & Thomas Lidbetter & Alec Morton, 2016. "Patrolling a Border," Operations Research, INFORMS, vol. 64(6), pages 1256-1269, December.
    • Handle: RePEc:inm:oropre:v:64:y:2016:i:6:p:1256-1269
    DOI: 10.1287/opre.2016.1511
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.2016.1511
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.2016.1511?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
    ---><---

    References listed on IDEAS

    as
    1. Vic Baston & Kensaku Kikuta, 2009. "Technical Note---An Ambush Game with a Fat Infiltrator," Operations Research, INFORMS, vol. 57(2), pages 514-519, April.
    2. V. J. Baston & F. A. Bostock, 1987. "A continuous game of ambush," Naval Research Logistics (NRL), John Wiley & Sons, vol. 34(5), pages 645-654, October.
    3. Kyle Y. Lin & Michael P. Atkinson & Timothy H. Chung & Kevin D. Glazebrook, 2013. "A Graph Patrol Problem with Random Attack Times," Operations Research, INFORMS, vol. 61(3), pages 694-710, June.
    4. Vic Baston & Kensaku Kikuta, 2004. "An Ambush Game with an Unknown Number of Infiltrators," Operations Research, INFORMS, vol. 52(4), pages 597-605, August.
    5. Roberto Szechtman & Moshe Kress & Kyle Lin & Dolev Cfir, 2008. "Models of sensor operations for border surveillance," Naval Research Logistics (NRL), John Wiley & Sons, vol. 55(1), pages 27-41, February.
    6. Kyle Y. Lin & Michael P. Atkinson & Kevin D. Glazebrook, 2014. "Optimal patrol to uncover threats in time when detection is imperfect," Naval Research Logistics (NRL), John Wiley & Sons, vol. 61(8), pages 557-576, December.
    7. Baykal-Gürsoy, Melike & Duan, Zhe & Poor, H. Vincent & Garnaev, Andrey, 2014. "Infrastructure security games," European Journal of Operational Research, Elsevier, vol. 239(2), pages 469-478.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Garrec, Tristan, 2019. "Continuous patrolling and hiding games," European Journal of Operational Research, Elsevier, vol. 277(1), pages 42-51.
    2. Wang, Jian & Cui, Lei, 2023. "Patrolling games with coordination between monitoring devices and patrols," Reliability Engineering and System Safety, Elsevier, vol. 233(C).
    3. Alpern, Steve & Lidbetter, Thomas & Papadaki, Katerina, 2019. "Optimizing periodic patrols against short attacks on the line and other networks," European Journal of Operational Research, Elsevier, vol. 273(3), pages 1065-1073.
    4. Darlington, Matthew & Glazebrook, Kevin D. & Leslie, David S. & Shone, Rob & Szechtman, Roberto, 2023. "A stochastic game framework for patrolling a border," European Journal of Operational Research, Elsevier, vol. 311(3), pages 1146-1158.
    5. G. Liuzzi & M. Locatelli & V. Piccialli & S. Rass, 2021. "Computing mixed strategies equilibria in presence of switching costs by the solution of nonconvex QP problems," Computational Optimization and Applications, Springer, vol. 79(3), pages 561-599, July.
    6. Baston, Vic & Kikuta, Kensaku, 2019. "A search problem on a bipartite network," European Journal of Operational Research, Elsevier, vol. 277(1), pages 227-237.
    7. Zhang, Laobing & Reniers, Genserik & Chen, Bin & Qiu, Xiaogang, 2019. "CCP game: A game theoretical model for improving the scheduling of chemical cluster patrolling," Reliability Engineering and System Safety, Elsevier, vol. 191(C).

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Alpern, Steve & Lidbetter, Thomas & Papadaki, Katerina, 2019. "Optimizing periodic patrols against short attacks on the line and other networks," European Journal of Operational Research, Elsevier, vol. 273(3), pages 1065-1073.
    2. Garrec, Tristan, 2019. "Continuous patrolling and hiding games," European Journal of Operational Research, Elsevier, vol. 277(1), pages 42-51.
    3. Alpern, Steve & Fokkink, Robbert & Simanjuntak, Martin, 2016. "Optimal search and ambush for a hider who can escape the search region," European Journal of Operational Research, Elsevier, vol. 251(3), pages 707-714.
    4. Sushil Gupta & Martin K. Starr & Reza Zanjirani Farahani & Mahsa Mahboob Ghodsi, 2020. "Prevention of Terrorism–An Assessment of Prior POM Work and Future Potentials," Production and Operations Management, Production and Operations Management Society, vol. 29(7), pages 1789-1815, July.
    5. Ben Hermans & Herbert Hamers & Roel Leus & Roy Lindelauf, 2019. "Timely exposure of a secret project: Which activities to monitor?," Naval Research Logistics (NRL), John Wiley & Sons, vol. 66(6), pages 451-468, September.
    6. Darlington, Matthew & Glazebrook, Kevin D. & Leslie, David S. & Shone, Rob & Szechtman, Roberto, 2023. "A stochastic game framework for patrolling a border," European Journal of Operational Research, Elsevier, vol. 311(3), pages 1146-1158.
    7. Kyle Y. Lin & Michael P. Atkinson & Timothy H. Chung & Kevin D. Glazebrook, 2013. "A Graph Patrol Problem with Random Attack Times," Operations Research, INFORMS, vol. 61(3), pages 694-710, June.
    8. Vic Baston & Kensaku Kikuta, 2009. "Technical Note---An Ambush Game with a Fat Infiltrator," Operations Research, INFORMS, vol. 57(2), pages 514-519, April.
    9. Fang Lu & John J. Hasenbein & David P. Morton, 2016. "Modeling and Optimization of a Spatial Detection System," INFORMS Journal on Computing, INFORMS, vol. 28(3), pages 512-526, August.
    10. Corine M. Laan & Ana Isabel Barros & Richard J. Boucherie & Herman Monsuur & Judith Timmer, 2019. "Solving partially observable agent‐intruder games with an application to border security problems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 66(2), pages 174-190, March.
    11. Nguyen, Di H. & Smith, J. Cole, 2022. "Network interdiction with asymmetric cost uncertainty," European Journal of Operational Research, Elsevier, vol. 297(1), pages 239-251.
    12. Zoroa, Noemi & Zoroa, Procopio & Jose Fernandez-Saez, M., 1999. "A generalization of Ruckle's results for an ambush game," European Journal of Operational Research, Elsevier, vol. 119(2), pages 353-364, December.
    13. José Correa & Tobias Harks & Vincent J. C. Kreuzen & Jannik Matuschke, 2017. "Fare Evasion in Transit Networks," Operations Research, INFORMS, vol. 65(1), pages 165-183, February.
    14. Vic Baston & Kensaku Kikuta, 2004. "An Ambush Game with an Unknown Number of Infiltrators," Operations Research, INFORMS, vol. 52(4), pages 597-605, August.
    15. Steve Alpern & Robbert Fokkink & Christos Pelekis, 2012. "A Proof of the Kikuta–Ruckle Conjecture on Cyclic Caching of Resources," Journal of Optimization Theory and Applications, Springer, vol. 153(3), pages 650-661, June.
    16. Karwowski, Jan & Mańdziuk, Jacek, 2019. "A Monte Carlo Tree Search approach to finding efficient patrolling schemes on graphs," European Journal of Operational Research, Elsevier, vol. 277(1), pages 255-268.
    17. Steve Alpern & Thomas Lidbetter, 2019. "Approximate solutions for expanding search games on general networks," Annals of Operations Research, Springer, vol. 275(2), pages 259-279, April.
    18. Wei, Ningji & Walteros, Jose L., 2022. "Integer programming methods for solving binary interdiction games," European Journal of Operational Research, Elsevier, vol. 302(2), pages 456-469.
    19. Ford, Stephen & Atkinson, Michael P. & Glazebrook, Kevin & Jacko, Peter, 2020. "On the dynamic allocation of assets subject to failure," European Journal of Operational Research, Elsevier, vol. 284(1), pages 227-239.
    20. I.D. Woodward, 2003. "Discretization of the continuous ambush game," Naval Research Logistics (NRL), John Wiley & Sons, vol. 50(5), pages 515-529, August.

    More about this item

    Keywords

    search and surveillance; patrolling;

    Statistics

    Access and download statistics

    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:64:y:2016:i:6:p:1256-1269. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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.