IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v225y2015i1p91-10910.1007-s10479-012-1196-0.html
   My bibliography  Save this article

Allocating multiple defensive resources in a zero-sum game setting

Author

Listed:
  • B. Golany
  • N. Goldberg
  • U. Rothblum

Abstract

This paper investigates the problem of allocating multiple defensive resources to protect multiple sites against possible attacks by an adversary. The effectiveness of the resources in reducing potential damage to the sites is assumed to vary across the resources and across the sites and their availability is constrained. The problem is formulated as a two-person zero-sum game with piecewise linear utility functions and polyhedral action sets. Linearization of the utility functions is applied in order to reduce the computation of the game’s Nash equilibria to the solution of a pair of linear programs (LPs). The reduction facilitates revelation of structure of Nash equilibrium allocations, in particular, of monotonicity properties of these allocations with respect to the amounts of available resources. Finally, allocation problems in non-competitive settings are examined (i.e., situations where the attacker chooses its targets independently of actions taken by the defender) and the structure of solutions in such settings is compared to that of Nash equilibria. Copyright Springer Science+Business Media, LLC 2015

Suggested Citation

  • B. Golany & N. Goldberg & U. Rothblum, 2015. "Allocating multiple defensive resources in a zero-sum game setting," Annals of Operations Research, Springer, vol. 225(1), pages 91-109, February.
    • Handle: RePEc:spr:annopr:v:225:y:2015:i:1:p:91-109:10.1007/s10479-012-1196-0
    DOI: 10.1007/s10479-012-1196-0
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10479-012-1196-0
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10479-012-1196-0?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. Luss, Hanan, 1992. "Minimax resource allocation problems: Optimization and parametric analysis," European Journal of Operational Research, Elsevier, vol. 60(1), pages 76-86, July.
    2. Brian Roberson, 2006. "The Colonel Blotto game," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 29(1), pages 1-24, September.
    3. Vicki M. Bier & Naraphorn Haphuriwat & Jaime Menoyo & Rae Zimmerman & Alison M. Culpen, 2008. "Optimal Resource Allocation for Defense of Targets Based on Differing Measures of Attractiveness," Risk Analysis, John Wiley & Sons, vol. 28(3), pages 763-770, June.
    4. Golany, Boaz & Kaplan, Edward H. & Marmur, Abraham & Rothblum, Uriel G., 2009. "Nature plays with dice - terrorists do not: Allocating resources to counter strategic versus probabilistic risks," European Journal of Operational Research, Elsevier, vol. 192(1), pages 198-208, January.
    5. George B. Dantzig, 1957. "Discrete-Variable Extremum Problems," Operations Research, INFORMS, vol. 5(2), pages 266-288, April.
    6. 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.
    7. Hanan Luss, 1999. "On Equitable Resource Allocation Problems: A Lexicographic Minimax Approach," Operations Research, INFORMS, vol. 47(3), pages 361-378, June.
    8. Pelin G. Canbolat & Boaz Golany & Inbal Mund & Uriel G. Rothblum, 2012. "A Stochastic Competitive R&D Race Where “Winner Takes All”," Operations Research, INFORMS, vol. 60(3), pages 700-715, June.
    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. Johnston, Iain G., 2022. "Optimal strategies in the fighting fantasy gaming system: Influencing stochastic dynamics by gambling with limited resource," European Journal of Operational Research, Elsevier, vol. 302(3), pages 1272-1281.
    2. 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.
    3. Han, Lin & Zhao, Xudong & Chen, Zhilong & Gong, Huadong & Hou, Benwei, 2021. "Assessing resilience of urban lifeline networks to intentional attacks," Reliability Engineering and System Safety, Elsevier, vol. 207(C).
    4. Paulson, Elisabeth C. & Linkov, Igor & Keisler, Jeffrey M., 2016. "A game theoretic model for resource allocation among countermeasures with multiple attributes," European Journal of Operational Research, Elsevier, vol. 252(2), pages 610-622.

    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. Mohammad E. Nikoofal & Jun Zhuang, 2012. "Robust Allocation of a Defensive Budget Considering an Attacker's Private Information," Risk Analysis, John Wiley & Sons, vol. 32(5), pages 930-943, May.
    2. Mohsen Golalikhani & Jun Zhuang, 2011. "Modeling Arbitrary Layers of Continuous‐Level Defenses in Facing with Strategic Attackers," Risk Analysis, John Wiley & Sons, vol. 31(4), pages 533-547, April.
    3. Shan, Xiaojun & Zhuang, Jun, 2013. "Hybrid defensive resource allocations in the face of partially strategic attackers in a sequential defender–attacker game," European Journal of Operational Research, Elsevier, vol. 228(1), pages 262-272.
    4. Mohammad E. Nikoofal & Mehmet Gümüs, 2015. "On the value of terrorist’s private information in a government’s defensive resource allocation problem," IISE Transactions, Taylor & Francis Journals, vol. 47(6), pages 533-555, June.
    5. Niyazi Bakır, 2011. "A Stackelberg game model for resource allocation in cargo container security," Annals of Operations Research, Springer, vol. 187(1), pages 5-22, July.
    6. Shan, Xiaojun & Zhuang, Jun, 2018. "Modeling cumulative defensive resource allocation against a strategic attacker in a multi-period multi-target sequential game," Reliability Engineering and System Safety, Elsevier, vol. 179(C), pages 12-26.
    7. Edouard Kujawski, 2015. "Accounting for Terrorist Behavior in Allocating Defensive Counterterrorism Resources," Systems Engineering, John Wiley & Sons, vol. 18(4), pages 365-376, July.
    8. Kjell Hausken, 2019. "Special versus general protection and attack of two assets," Operations Research and Decisions, Wroclaw University of Science and Technology, Faculty of Management, vol. 29(4), pages 53-93.
    9. Mohammad Ebrahim Nikoofal & Morteza Pourakbar & Mehmet Gumus, 2023. "Securing containerized supply chain through public and private partnership," Production and Operations Management, Production and Operations Management Society, vol. 32(7), pages 2341-2361, July.
    10. Abdolmajid Yolmeh & Melike Baykal-Gürsoy, 2019. "Two-Stage Invest–Defend Game: Balancing Strategic and Operational Decisions," Decision Analysis, INFORMS, vol. 16(1), pages 46-66, March.
    11. Nikoofal, Mohammad E. & Zhuang, Jun, 2015. "On the value of exposure and secrecy of defense system: First-mover advantage vs. robustness," European Journal of Operational Research, Elsevier, vol. 246(1), pages 320-330.
    12. Chen, Shun & Zhao, Xudong & Chen, Zhilong & Hou, Benwei & Wu, Yipeng, 2022. "A game-theoretic method to optimize allocation of defensive resource to protect urban water treatment plants against physical attacks," International Journal of Critical Infrastructure Protection, Elsevier, vol. 36(C).
    13. Xiaojun (Gene) Shan & Jun Zhuang, 2014. "Modeling Credible Retaliation Threats in Deterring the Smuggling of Nuclear Weapons Using Partial Inspection---A Three-Stage Game," Decision Analysis, INFORMS, vol. 11(1), pages 43-62, March.
    14. Subhasish Chowdhury & Dan Kovenock & Roman Sheremeta, 2013. "An experimental investigation of Colonel Blotto games," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 52(3), pages 833-861, April.
    15. Ulrich Hendel, 2016. "‘Look like the innocent flower, but be the serpent under’t’: mimicking behaviour of growth-oriented terrorist organizations," Defence and Peace Economics, Taylor & Francis Journals, vol. 27(5), pages 665-687, September.
    16. Mhand Hifi & Slim Sadfi & Abdelkader Sbihi, 2004. "An Exact Algorithm for the Multiple-choice Multidimensional Knapsack Problem," Post-Print halshs-03322716, HAL.
    17. Sbihi, Abdelkader, 2010. "A cooperative local search-based algorithm for the Multiple-Scenario Max-Min Knapsack Problem," European Journal of Operational Research, Elsevier, vol. 202(2), pages 339-346, April.
    18. Han, Lin & Zhao, Xudong & Chen, Zhilong & Gong, Huadong & Hou, Benwei, 2021. "Assessing resilience of urban lifeline networks to intentional attacks," Reliability Engineering and System Safety, Elsevier, vol. 207(C).
    19. Dan Kovenock & Brian Roberson & Roman M. Sheremeta, 2019. "The attack and defense of weakest-link networks," Public Choice, Springer, vol. 179(3), pages 175-194, June.
    20. Hendel, Ulrich, 2012. ""Look like the innocent flower, but be the serpent under't": Mimicking behaviour of growth-oriented terrorist organizations," Discussion Papers in Economics 13998, University of Munich, Department of Economics.

    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:spr:annopr:v:225:y:2015:i:1:p:91-109:10.1007/s10479-012-1196-0. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.