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

A stochastic game framework for patrolling a border

Author

Listed:
  • Darlington, Matthew
  • Glazebrook, Kevin D.
  • Leslie, David S.
  • Shone, Rob
  • Szechtman, Roberto

Abstract

In this paper we consider a stochastic game for modelling the interactions between smugglers and a patroller along a border. The problem we examine involves a group of cooperating smugglers making regular attempts to bring small amounts of illicit goods across a border. A single patroller has the goal of preventing the smugglers from doing so, but must pay a cost to travel from one location to another. We model the problem as a two-player stochastic game and look to find a Nash equilibrium to gain insight into real world problems. Our framework extends the literature by assuming that the smugglers choose a continuous quantity of contraband, complicating the analysis of the game. We discuss a number of properties of Nash equilibria, including the aggregation of smugglers, the discount factors of the players, and the equivalence of our non zero-sum game to a zero-sum game. Additionally, we present algorithms to find Nash equilibria that are more computationally efficient than existing methods. We also consider certain assumptions on the parameters of the model that give interesting equilibrium strategies for the players.

Suggested Citation

  • 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.
    • Handle: RePEc:eee:ejores:v:311:y:2023:i:3:p:1146-1158
    DOI: 10.1016/j.ejor.2023.06.011
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221723004630
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2023.06.011?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. Dorit S. Hochbaum, 1994. "Lower and Upper Bounds for the Allocation Problem and Other Nonlinear Optimization Problems," Mathematics of Operations Research, INFORMS, vol. 19(2), pages 390-409, May.
    2. Bennett Fox, 1966. "Discrete Optimization Via Marginal Analysis," Management Science, INFORMS, vol. 13(3), pages 210-216, November.
    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. Richard G. McGrath & Kyle Y. Lin, 2017. "Robust patrol strategies against attacks at dispersed heterogeneous locations," International Journal of Operational Research, Inderscience Enterprises Ltd, vol. 30(3), pages 340-359.
    5. 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.
    6. V. J. Baston & F. A. Bostock, 1991. "A generalized inspection game," Naval Research Logistics (NRL), John Wiley & Sons, vol. 38(2), pages 171-182, April.
    7. Grant, James A. & Leslie, David S. & Glazebrook, Kevin & Szechtman, Roberto & Letchford, Adam N., 2020. "Adaptive policies for perimeter surveillance problems," European Journal of Operational Research, Elsevier, vol. 283(1), pages 265-278.
    8. Katerina Papadaki & Steve Alpern & Thomas Lidbetter & Alec Morton, 2016. "Patrolling a Border," Operations Research, INFORMS, vol. 64(6), pages 1256-1269, December.
    9. 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.
    Full references (including those not matched with items on IDEAS)

    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. Garrec, Tristan, 2019. "Continuous patrolling and hiding games," European Journal of Operational Research, Elsevier, vol. 277(1), pages 42-51.
    2. 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.
    3. Hunt, Kyle & Zhuang, Jun, 2024. "A review of attacker-defender games: Current state and paths forward," European Journal of Operational Research, Elsevier, vol. 313(2), pages 401-417.
    4. Katerina Papadaki & Steve Alpern & Thomas Lidbetter & Alec Morton, 2016. "Patrolling a Border," Operations Research, INFORMS, vol. 64(6), pages 1256-1269, December.
    5. Baston, Vic & Kikuta, Kensaku, 2019. "A search problem on a bipartite network," European Journal of Operational Research, Elsevier, vol. 277(1), pages 227-237.
    6. Wang, Jian & Cui, Lei, 2023. "Patrolling games with coordination between monitoring devices and patrols," Reliability Engineering and System Safety, Elsevier, vol. 233(C).
    7. Ching, Wai Ki, 1997. "Markov-modulated Poisson processes for multi-location inventory problems," International Journal of Production Economics, Elsevier, vol. 53(2), pages 217-223, November.
    8. Mustafa Doğru & A. Kok & G. Houtum, 2013. "Newsvendor characterizations for one-warehouse multi-retailer inventory systems with discrete demand under the balance assumption," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 21(3), pages 541-559, September.
    9. Xiuli Chao & Liming Liu & Shaohui Zheng, 2003. "Resource Allocation in Multisite Service Systems with Intersite Customer Flows," Management Science, INFORMS, vol. 49(12), pages 1739-1752, December.
    10. Anh Ninh & Benjamin Melamed & Yao Zhao, 2020. "Analysis and optimization of recruitment stocking problems," Annals of Operations Research, Springer, vol. 295(2), pages 747-767, December.
    11. Walter, Rico & Boysen, Nils & Scholl, Armin, 2013. "The discrete forward–reserve problem – Allocating space, selecting products, and area sizing in forward order picking," European Journal of Operational Research, Elsevier, vol. 229(3), pages 585-594.
    12. Lee, Zu-Hsu & Deng, Shiming & Lin, Beixin & Yang, James G.S., 2010. "Decision model and analysis for investment interest expense deduction and allocation," European Journal of Operational Research, Elsevier, vol. 200(1), pages 268-280, January.
    13. 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.
    14. Kochel, P., 2007. "Order optimisation in multi-location models with hub-and-spoke structure," International Journal of Production Economics, Elsevier, vol. 108(1-2), pages 368-387, July.
    15. Thomas L. Morin & Roy E. Marsten, 1974. "Brand-and-Bound Strategies for Dynamic Programming," Discussion Papers 106, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
    16. Xiaobo Zhao & Fan Fan & Xiaoliang Liu & Jinxing Xie, 2007. "Storage-Space Capacitated Inventory System with ( r, Q ) Policies," Operations Research, INFORMS, vol. 55(5), pages 854-865, October.
    17. Benjaafar, Saifallah, 1995. "Performance bounds for the effectiveness of pooling in multi-processing systems," European Journal of Operational Research, Elsevier, vol. 87(2), pages 375-388, December.
    18. Daniel Freund & Shane G. Henderson & Eoin O’Mahony & David B. Shmoys, 2019. "Analytics and Bikes: Riding Tandem with Motivate to Improve Mobility," Interfaces, INFORMS, vol. 49(5), pages 310-323, September.
    19. Yossi Aviv & Awi Federgruen, 2001. "Design for Postponement: A Comprehensive Characterization of Its Benefits Under Unknown Demand Distributions," Operations Research, INFORMS, vol. 49(4), pages 578-598, August.
    20. Li Ding & Kevin D. Glazebrook & Christopher Kirkbride, 2008. "Allocation Models and Heuristics for the Outsourcing of Repairs for a Dynamic Warranty Population," Management Science, INFORMS, vol. 54(3), pages 594-607, March.

    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:311:y:2023:i:3:p:1146-1158. 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.