IDEAS home Printed from https://ideas.repec.org/a/wly/navres/v64y2017i2p139-153.html
   My bibliography  Save this article

Non‐zero‐sum nonlinear network path interdiction with an application to inspection in terror networks

Author

Listed:
  • Noam Goldberg

Abstract

A simultaneous non‐zero‐sum game is modeled to extend the classical network interdiction problem. In this model, an interdictor (e.g., an enforcement agent) decides how much of an inspection resource to spend along each arc in the network to capture a smuggler. The smuggler (randomly) selects a commodity to smuggle—a source and destination pair of nodes, and also a corresponding path for traveling between the given pair of nodes. This model is motivated by a terrorist organization that can mobilize its human, financial, or weapon resources to carry out an attack at one of several potential target destinations. The probability of evading each of the network arcs nonlinearly decreases in the amount of resource that the interdictor spends on its inspection. We show that under reasonable assumptions with respect to the evasion probability functions, (approximate) Nash equilibria of this game can be determined in polynomial time; depending on whether the evasion functions are exponential or general logarithmically‐convex functions, exact Nash equilibria or approximate Nash equilibria, respectively, are computed. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 139–153, 2017

Suggested Citation

  • Noam Goldberg, 2017. "Non‐zero‐sum nonlinear network path interdiction with an application to inspection in terror networks," Naval Research Logistics (NRL), John Wiley & Sons, vol. 64(2), pages 139-153, March.
    • Handle: RePEc:wly:navres:v:64:y:2017:i:2:p:139-153
    DOI: 10.1002/nav.21738
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/nav.21738
    Download Restriction: no
    File URL: https://libkey.io/10.1002/nav.21738?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. Kelly J. Cormican & David P. Morton & R. Kevin Wood, 1998. "Stochastic Network Interdiction," Operations Research, INFORMS, vol. 46(2), pages 184-197, April.
    2. Powell, Robert, 2007. "Allocating Defensive Resources with Private Information about Vulnerability," American Political Science Review, Cambridge University Press, vol. 101(4), pages 799-809, November.
    3. Richard Wollmer, 1964. "Removing Arcs from a Network," Operations Research, INFORMS, vol. 12(6), pages 934-940, December.
    4. Bruce Golden, 1978. "A problem in network interdiction," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 25(4), pages 711-713, December.
    5. Arkadi Nemirovski & Shmuel Onn & Uriel G. Rothblum, 2010. "Accuracy Certificates for Computational Problems with Convex Structure," Mathematics of Operations Research, INFORMS, vol. 35(1), pages 52-78, February.
    6. Bruce P. Burrell & Michael J. Todd, 1985. "The Ellipsoid Method Generates Dual Variables," Mathematics of Operations Research, INFORMS, vol. 10(4), pages 688-700, November.
    7. Alan W. McMasters & Thomas M. Mustin, 1970. "Optimal interdiction of a supply network," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 17(3), pages 261-268, September.
    8. Yael Deutsch & Boaz Golany & Noam Goldberg & Uriel G. Rothblum, 2013. "Inspection games with local and global allocation bounds," Naval Research Logistics (NRL), John Wiley & Sons, vol. 60(2), pages 125-140, March.
    9. Powell, Robert, 2007. "Defending against Terrorist Attacks with Limited Resources," American Political Science Review, Cambridge University Press, vol. 101(3), pages 527-541, August.
    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. Deutsch, Yael & Goldberg, Noam & Perlman, Yael, 2019. "Incorporating monitoring technology and on-site inspections into an n-person inspection game," European Journal of Operational Research, Elsevier, vol. 274(2), pages 627-637.
    2. Smith, J. Cole & Song, Yongjia, 2020. "A survey of network interdiction models and algorithms," European Journal of Operational Research, Elsevier, vol. 283(3), pages 797-811.
    3. Goldberg, Noam & Poss, Michael, 2020. "Maximum probabilistic all-or-nothing paths," European Journal of Operational Research, Elsevier, vol. 283(1), pages 279-289.
    4. 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.
    5. Claudio Contardo & Jorge A. Sefair, 2022. "A Progressive Approximation Approach for the Exact Solution of Sparse Large-Scale Binary Interdiction Games," INFORMS Journal on Computing, INFORMS, vol. 34(2), pages 890-908, March.

    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. Smith, J. Cole & Song, Yongjia, 2020. "A survey of network interdiction models and algorithms," European Journal of Operational Research, Elsevier, vol. 283(3), pages 797-811.
    2. Chaya Losada & M. Scaparra & Richard Church & Mark Daskin, 2012. "The stochastic interdiction median problem with disruption intensity levels," Annals of Operations Research, Springer, vol. 201(1), pages 345-365, December.
    3. Bloch, Francis & Chatterjee, Kalyan & Dutta, Bhaskar, 2023. "Attack and interception in networks," Theoretical Economics, Econometric Society, vol. 18(4), November.
    4. Claudio Contardo & Jorge A. Sefair, 2022. "A Progressive Approximation Approach for the Exact Solution of Sparse Large-Scale Binary Interdiction Games," INFORMS Journal on Computing, INFORMS, vol. 34(2), pages 890-908, March.
    5. Abumoslem Mohammadi & Javad Tayyebi, 2019. "Maximum Capacity Path Interdiction Problem with Fixed Costs," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 36(04), pages 1-21, August.
    6. 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.
    7. Yan, Xihong & Ren, Xiaorong & Nie, Xiaofeng, 2022. "A budget allocation model for domestic airport network protection," Socio-Economic Planning Sciences, Elsevier, vol. 82(PB).
    8. Kübra Tanınmış & Markus Sinnl, 2022. "A Branch-and-Cut Algorithm for Submodular Interdiction Games," INFORMS Journal on Computing, INFORMS, vol. 34(5), pages 2634-2657, September.
    9. Tony H. Grubesic & Timothy C. Matisziw & Alan T. Murray & Diane Snediker, 2008. "Comparative Approaches for Assessing Network Vulnerability," International Regional Science Review, , vol. 31(1), pages 88-112, January.
    10. Eli Towle & James Luedtke, 2018. "New solution approaches for the maximum-reliability stochastic network interdiction problem," Computational Management Science, Springer, vol. 15(3), pages 455-477, October.
    11. Zhang, Jing & Zhuang, Jun & Behlendorf, Brandon, 2018. "Stochastic shortest path network interdiction with a case study of Arizona–Mexico border," Reliability Engineering and System Safety, Elsevier, vol. 179(C), pages 62-73.
    12. Young‐Soo Myung & Hyun‐Joon Kim, 2007. "Network disconnection problems in a centralized network," Naval Research Logistics (NRL), John Wiley & Sons, vol. 54(7), pages 710-719, October.
    13. Jabarzare, Ziba & Zolfagharinia, Hossein & Najafi, Mehdi, 2020. "Dynamic interdiction networks with applications in illicit supply chains," Omega, Elsevier, vol. 96(C).
    14. Ting L. Lei, 2019. "Evaluating the Vulnerability of Time-Sensitive Transportation Networks: A Hub Center Interdiction Problem," Sustainability, MDPI, vol. 11(17), pages 1-13, August.
    15. Juan S. Borrero & Leonardo Lozano, 2021. "Modeling Defender-Attacker Problems as Robust Linear Programs with Mixed-Integer Uncertainty Sets," INFORMS Journal on Computing, INFORMS, vol. 33(4), pages 1570-1589, October.
    16. Kosanoglu, Fuat & Bier, Vicki M., 2020. "Target-oriented utility for interdiction of transportation networks," Reliability Engineering and System Safety, Elsevier, vol. 197(C).
    17. Harald Held & Raymond Hemmecke & David L. Woodruff, 2005. "A decomposition algorithm applied to planning the interdiction of stochastic networks," Naval Research Logistics (NRL), John Wiley & Sons, vol. 52(4), pages 321-328, June.
    18. Levitin, Gregory & Hausken, Kjell, 2009. "Intelligence and impact contests in systems with redundancy, false targets, and partial protection," Reliability Engineering and System Safety, Elsevier, vol. 94(12), pages 1927-1941.
    19. Laan, Corine M. & van der Mijden, Tom & Barros, Ana Isabel & Boucherie, Richard J. & Monsuur, Herman, 2017. "An interdiction game on a queueing network with multiple intruders," European Journal of Operational Research, Elsevier, vol. 260(3), pages 1069-1080.
    20. Hadi Yektaş & Magnus Hoffmann & Friedhelm Hentschel & Roland Hodler, 2019. "Wars of Conquest and Independence," Journal of Institutional and Theoretical Economics (JITE), Mohr Siebeck, Tübingen, vol. 175(4), pages 617-640.

    More about this item

    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:wly:navres:v:64:y:2017:i:2:p:139-153. 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: Wiley Content Delivery (email available below). General contact details of provider: https://doi.org/10.1002/(ISSN)1520-6750 .

    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.