IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v273y2019i3p1065-1073.html
   My bibliography  Save this article

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

Author

Listed:
  • Alpern, Steve
  • Lidbetter, Thomas
  • Papadaki, Katerina

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.

Suggested Citation

  • 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.
    • Handle: RePEc:eee:ejores:v:273:y:2019:i:3:p:1065-1073
    DOI: 10.1016/j.ejor.2018.08.050
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221718307458
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2018.08.050?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    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. V. J. Baston & A. Y. Garnaev, 1996. "A fast infiltration game on n arcs," Naval Research Logistics (NRL), John Wiley & Sons, vol. 43(4), pages 481-489, June.
    4. 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.
    5. P. Goutal & A. Garnaev & G. Garnaeva, 1997. "On the Infiltration Game," International Journal of Game Theory, Springer;Game Theory Society, vol. 26(2), pages 215-221.
    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. Hoam Chung & Elijah Polak & Johannes O. Royset & Shankar Sastry, 2011. "On the optimal detection of an underwater intruder in a channel using unmanned underwater vehicles," Naval Research Logistics (NRL), John Wiley & Sons, vol. 58(8), pages 804-820, December.
    8. Vic Baston & Kensaku Kikuta, 2004. "An Ambush Game with an Unknown Number of Infiltrators," Operations Research, INFORMS, vol. 52(4), pages 597-605, August.
    9. 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.
    10. Alan R. Washburn, 1982. "On patrolling a channel," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 29(4), pages 609-615, December.
    11. Katerina Papadaki & Steve Alpern & Thomas Lidbetter & Alec Morton, 2016. "Patrolling a Border," Operations Research, INFORMS, vol. 64(6), pages 1256-1269, December.
    12. Zoroa, N. & Fernández-Sáez, M.J. & Zoroa, P., 2012. "Patrolling a perimeter," European Journal of Operational Research, Elsevier, vol. 222(3), pages 571-582.
    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. Wang, Jian & Cui, Lei, 2023. "Patrolling games with coordination between monitoring devices and patrols," Reliability Engineering and System Safety, Elsevier, vol. 233(C).
    2. 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.
    3. Baston, Vic & Kikuta, Kensaku, 2019. "A search problem on a bipartite network," European Journal of Operational Research, Elsevier, vol. 277(1), pages 227-237.
    4. Caraballo, Luis E. & Díaz-Báñez, José M. & Fabila-Monroy, Ruy & Hidalgo-Toscano, Carlos, 2022. "Stochastic strategies for patrolling a terrain with a synchronized multi-robot system," European Journal of Operational Research, Elsevier, vol. 301(3), pages 1099-1116.

    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. Katerina Papadaki & Steve Alpern & Thomas Lidbetter & Alec Morton, 2016. "Patrolling a Border," Operations Research, INFORMS, vol. 64(6), pages 1256-1269, December.
    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. 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. Zoroa, N. & Fernández-Sáez, M.J. & Zoroa, P., 2012. "Patrolling a perimeter," European Journal of Operational Research, Elsevier, vol. 222(3), pages 571-582.
    6. Bui, Thuy & Lidbetter, Thomas, 2023. "Optimal patrolling strategies for trees and complete networks," European Journal of Operational Research, Elsevier, vol. 311(2), pages 769-776.
    7. Zoroa, N. & Zoroa, P. & Fernández-Sáez, M.J., 2009. "Weighted search games," European Journal of Operational Research, Elsevier, vol. 195(2), pages 394-411, 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. Joseph Foraker & Seungho Lee & Elijah Polak, 2016. "Validation of a strategy for harbor defense based on the use of a min‐max algorithm receding horizon control law," Naval Research Logistics (NRL), John Wiley & Sons, vol. 63(3), pages 247-259, April.
    10. 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.
    11. Wang, Jian & Cui, Lei, 2023. "Patrolling games with coordination between monitoring devices and patrols," Reliability Engineering and System Safety, Elsevier, vol. 233(C).
    12. 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.
    13. 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).
    14. 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.
    15. 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.
    16. 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.
    17. 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.
    18. Hoam Chung & Elijah Polak & Johannes O. Royset & Shankar Sastry, 2011. "On the optimal detection of an underwater intruder in a channel using unmanned underwater vehicles," Naval Research Logistics (NRL), John Wiley & Sons, vol. 58(8), pages 804-820, December.
    19. Claire Walton & Panos Lambrianides & Isaac Kaminer & Johannes Royset & Qi Gong, 2018. "Optimal motion planning in rapid‐fire combat situations with attacker uncertainty," Naval Research Logistics (NRL), John Wiley & Sons, vol. 65(2), pages 101-119, March.
    20. Calvin Kielas-Jensen & Venanzio Cichella & David Casbeer & Satyanarayana Gupta Manyam & Isaac Weintraub, 2021. "Persistent Monitoring by Multiple Unmanned Aerial Vehicles Using Bernstein Polynomials," Journal of Optimization Theory and Applications, Springer, vol. 191(2), pages 899-916, December.

    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:eee:ejores:v:273:y:2019:i:3:p:1065-1073. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.