IDEAS home Printed from https://ideas.repec.org/p/pur/prukra/1251.html
   My bibliography  Save this paper

The Optimal Defense of Networks of Targets

Author

Listed:
  • Dan Kovenock
  • Brian Roberson

Abstract

This paper examines a game-theoretic model of attack and defense of multiple networks of targets in which there exist intra-network strategic complementarities among targets. The defender’s objective is to successfully defend all of the networks and the attacker’s objective is to successfully attack at least one network of targets. In this context, our results highlight the importance of modeling asymmetric attack and defense as a conflict between “fully” strategic actors with endogenous entry and force expenditure decisions as well as allowing for general correlation structures for force expenditures within and across the networks of targets.

Suggested Citation

  • Dan Kovenock & Brian Roberson, 2010. "The Optimal Defense of Networks of Targets," Purdue University Economics Working Papers 1251, Purdue University, Department of Economics.
  • Handle: RePEc:pur:prukra:1251
    as

    Download full text from publisher

    File URL: http://www.krannert.purdue.edu/programs/phd/Working-papers-series/2010/1251.pdf
    Download Restriction: no

    Other versions of this item:

    References listed on IDEAS

    as
    1. Hortala-Vallve, Rafael & Llorente-Saguer, Aniol, 2010. "A simple mechanism for resolving conflict," Games and Economic Behavior, Elsevier, vol. 70(2), pages 375-391, November.
    2. Benny Moldovanu & Aner Sela, 2001. "The Optimal Allocation of Prizes in Contests," American Economic Review, American Economic Association, pages 542-558.
    3. Sanjeev Goyal & Adrien Vigier, 2014. "Attack, Defence, and Contagion in Networks," Review of Economic Studies, Oxford University Press, vol. 81(4), pages 1518-1542.
    4. Brian Roberson & Dmitriy Kvasov, 2012. "The non-constant-sum Colonel Blotto game," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), pages 397-433.
    5. Hausken, Kjell, 2008. "Strategic defense and attack for series and parallel reliability systems," European Journal of Operational Research, Elsevier, vol. 186(2), pages 856-881, April.
    6. Dan Kovenock & Michael R. Baye & Casper G. de Vries, 1996. "The all-pay auction with complete information (*)," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), pages 291-305.
    7. repec:cup:apsrev:v:101:y:2007:i:04:p:799-809_07 is not listed on IDEAS
    8. repec:oup:restud:v:81:y:2014:i:4:p:1518-1542. is not listed on IDEAS
    9. Vicki Bier & Santiago Oliveros & Larry Samuelson, 2007. "Choosing What to Protect: Strategic Defensive Allocation against an Unknown Attacker," Journal of Public Economic Theory, Association for Public Economic Theory, vol. 9(4), pages 563-587, August.
    10. Dan Kovenock & Michael R. Baye & Casper G. de Vries, 1996. "The all-pay auction with complete information (*)," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), pages 291-305.
    11. Konrad, Kai A., 2002. "Investment in the absence of property rights; the role of incumbency advantages," European Economic Review, Elsevier, pages 1521-1537.
    12. Todd R. Kaplan & David Wettstein, 2006. "Caps on Political Lobbying: Comment," American Economic Review, American Economic Association, pages 1351-1354.
    13. Amann, Erwin & Leininger, Wolfgang, 1996. "Asymmetric All-Pay Auctions with Incomplete Information: The Two-Player Case," Games and Economic Behavior, Elsevier, vol. 14(1), pages 1-18, May.
    14. Kvasov, Dmitriy, 2007. "Contests with limited resources," Journal of Economic Theory, Elsevier, vol. 136(1), pages 738-748, September.
    15. Moldovanu, Benny & Sela, Aner, 2006. "Contest architecture," Journal of Economic Theory, Elsevier, vol. 126(1), pages 70-96, January.
    16. Azaiez, M.N. & Bier, Vicki M., 2007. "Optimal resource allocation for security in reliability systems," European Journal of Operational Research, Elsevier, vol. 181(2), pages 773-786, September.
    17. Bernhardt, Dan & Polborn, Mattias K., 2010. "Non-convexities and the gains from concealing defenses from committed terrorists," Economics Letters, Elsevier, vol. 107(1), pages 52-54, April.
    18. Yeon-Koo Che & Ian L. Gale, 2006. "Caps on Political Lobbying: Reply," American Economic Review, American Economic Association, pages 1355-1360.
    19. Kolmar, Martin & Rommeswinkel, Hendrik, 2013. "Contests with group-specific public goods and complementarities in efforts," Journal of Economic Behavior & Organization, Elsevier, vol. 89(C), pages 9-22.
    20. B. Peter Rosendorff & Todd Sandler, 2004. "Too Much of a Good Thing?," Journal of Conflict Resolution, Peace Science Society (International), pages 657-671.
    21. Krishna, Vijay & Morgan, John, 1997. "An Analysis of the War of Attrition and the All-Pay Auction," Journal of Economic Theory, Elsevier, vol. 72(2), pages 343-362, February.
    22. Ron Siegel, 2009. "All-Pay Contests," Econometrica, Econometric Society, vol. 77(1), pages 71-92, January.
    23. Caroline D. Thomas, 2009. "N-Dimensional Blotto Game with Asymmetric Battlefield Values," Department of Economics Working Papers 130116, The University of Texas at Austin, Department of Economics, revised Dec 2016.
    24. repec:cup:apsrev:v:101:y:2007:i:03:p:527-541_07 is not listed on IDEAS
    25. repec:eee:reensy:v:93:y:2008:i:11:p:1740-1750 is not listed on IDEAS
    26. Jack Hirshleifer, 1983. "From weakest-link to best-shot: The voluntary provision of public goods," Public Choice, Springer, vol. 41(3), pages 371-386, January.
    27. Yosef Rinott & Marco Scarsini & Yaming Yu, 2012. "A Colonel Blotto Gladiator Game," Mathematics of Operations Research, INFORMS, vol. 37(4), pages 574-590, November.
    28. Benny Moldovanu & Aner Sela, 2001. "The Optimal Allocation of Prizes in Contests," American Economic Review, American Economic Association, pages 542-558.
    29. Ian Gale & Mark Stegeman, 1994. "Exclusion in all-pay auctions," Working Paper 9401, Federal Reserve Bank of Cleveland.
    30. Rafael Hortala-Vallve & Aniol Llorente-Saguer, 2012. "Pure strategy Nash equilibria in non-zero sum colonel Blotto games," International Journal of Game Theory, Springer;Game Theory Society, vol. 41(2), pages 331-343, May.
    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. B. Hoyer, 2012. "Network Disruption and the Common Enemy Effect," Working Papers 12-06, Utrecht School of Economics.
    2. Subhasish M. Chowdhury & Iryna Topolyan, 2013. "The Attack-and-Defence Group Contests," University of East Anglia Applied and Financial Economics Working Paper Series 049, School of Economics, University of East Anglia, Norwich, UK..
    3. Larson, Nathan, 2011. "Network security," MPRA Paper 32822, University Library of Munich, Germany.
    4. 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), pages 833-861.
    5. Subhasish M. Chowdhury & Dongryul Lee & Iryna Topolyan, 2013. "The Max-Min Group Contest," University of East Anglia Applied and Financial Economics Working Paper Series 050, School of Economics, University of East Anglia, Norwich, UK..
    6. McBride, Michael & Hewitt, David, 2013. "The enemy you can’t see: An investigation of the disruption of dark networks," Journal of Economic Behavior & Organization, Elsevier, vol. 93(C), pages 32-50.
    7. Emmanuel Dechenaux & Dan Kovenock & Roman Sheremeta, 2015. "A survey of experimental research on contests, all-pay auctions and tournaments," Experimental Economics, Springer;Economic Science Association, vol. 18(4), pages 609-669, December.
    8. Dziubiński, Marcin & Goyal, Sanjeev, 2013. "Network design and defence," Games and Economic Behavior, Elsevier, vol. 79(C), pages 30-43.
    9. Baba Yumiko, 2012. "A Note on a Comparison of Simultaneous and Sequential Colonel Blotto Games," Peace Economics, Peace Science, and Public Policy, De Gruyter, vol. 18(3), pages 1-6, December.
    10. Acemoglu, Daron & Malekian, Azarakhsh & Ozdaglar, Asu, 2016. "Network security and contagion," Journal of Economic Theory, Elsevier, vol. 166(C), pages 536-585.
    11. Aloni, Elad & Sela, Aner, 2012. "The assortative matching scheme in a survival battle," Economics Letters, Elsevier, vol. 117(1), pages 272-275.
    12. Dan Kovenock & Sudipta Sarangi & Matt Wiser, 2015. "All-pay 2 $$\times $$ × 2 Hex: a multibattle contest with complementarities," International Journal of Game Theory, Springer;Game Theory Society, vol. 44(3), pages 571-597, August.
    13. Dan Kovenock & Brian Roberson, 2012. "Strategic Defense And Attack For Series And Parallel Reliability Systems: Rejoinder," Defence and Peace Economics, Taylor & Francis Journals, pages 521-524.
    14. Dan Kovenock & Brian Roberson & Roman M. Sheremeta, 2010. "The Attack and Defense of Weakest-Link Networks," Working Papers 10-14, Chapman University, Economic Science Institute.
    15. Konrad, Kai A., 2007. "Strategy in contests: an introduction
      [Strategie in Turnieren – eine Einführung]
      ," Discussion Papers, Research Unit: Market Processes and Governance SP II 2007-01, Social Science Research Center Berlin (WZB).
    16. Sudipta Sarangi & Dan Kovenock & Matt Wiser, 2012. "All-Pay Hex: A Multibattle Contest With Complementarities," Departmental Working Papers 2012-06, Department of Economics, Louisiana State University.
    17. Cary Deck & Roman M. Sheremeta, 2012. "Fight or Flight?," Journal of Conflict Resolution, Peace Science Society (International), pages 1069-1088.
    18. Kjell Hausken, 2014. "Individual versus overarching protection and attack of assets," 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. 22(1), pages 89-112, March.
    19. Dan J. Kovenock & Brian Roberson, 2015. "Generalizations of the General Lotto and Colonel Blotto Games," CESifo Working Paper Series 5291, CESifo Group Munich.
    20. repec:bpj:pepspp:v:18:y:2012:i:3:p:6:n:6 is not listed on IDEAS
    21. Daniel G. Arce & Dan Kovenock J. & Brian Roberson, 2009. "Suicide Terrorism and the Weakest Link," CESifo Working Paper Series 2753, CESifo Group Munich.
    22. Cary Deck & Roman M. Sheremeta, 2012. "Fight or Flight?," Journal of Conflict Resolution, Peace Science Society (International), pages 1069-1088.

    More about this item

    Keywords

    Asymmetric Conflict; Attack and Defense; Weakest-Link; Best-Shot;

    JEL classification:

    • C7 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory
    • D74 - Microeconomics - - Analysis of Collective Decision-Making - - - Conflict; Conflict Resolution; Alliances; Revolutions

    NEP fields

    This paper has been announced in the following NEP Reports:

    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:pur:prukra:1251. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Krannert PHD). General contact details of provider: http://edirc.repec.org/data/kspurus.html .

    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 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.

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.