IDEAS home Printed from https://ideas.repec.org/a/eme/jrfpps/15265940810875577.html
   My bibliography  Save this article

A general defender‐attacker risk model for networks

Author

Listed:
  • W.I. Al Mannai
  • T.G. Lewis

Abstract

Purpose - The purpose of this paper is to present a competitive defender‐attacker risk model that assumes a dual exponential relationship between defender (Ci) and attacker (Ai) resource allocation:vi(Ai,Ci)=e−αici−e−αiCi−γiAi. Design/methodology/approach - Network risk is defined in terms of degree sequence,g, node/link damage,d, and probability of failure,v: R=∑gividi. The paper finds the optimal allocation of resources (Ai,Ci) that minimizesRfrom the defender's point of view, and maximizesRfrom the attacker's point of view. Findings - The effectiveness of the optimal min‐max strategy is compared with three allocation strategies: random, non‐network, and network. It is shown that total network risk is minimized by the non‐network strategy, because this strategy considers damage values and ignores network topology in the definition of risk. Originality/value - The method is illustrated by applying it to critical infrastructure – a hypothetical water‐and‐power network.

Suggested Citation

  • W.I. Al Mannai & T.G. Lewis, 2008. "A general defender‐attacker risk model for networks," Journal of Risk Finance, Emerald Group Publishing Limited, vol. 9(3), pages 244-261, May.
  • Handle: RePEc:eme:jrfpps:15265940810875577
    DOI: 10.1108/15265940810875577
    as

    Download full text from publisher

    File URL: https://www.emerald.com/insight/content/doi/10.1108/15265940810875577/full/html?utm_source=repec&utm_medium=feed&utm_campaign=repec
    Download Restriction: Access to full text is restricted to subscribers

    File URL: https://www.emerald.com/insight/content/doi/10.1108/15265940810875577/full/pdf?utm_source=repec&utm_medium=feed&utm_campaign=repec
    Download Restriction: Access to full text is restricted to subscribers

    File URL: https://libkey.io/10.1108/15265940810875577?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.

    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:eme:jrfpps:15265940810875577. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Emerald Support (email available below). General contact details of provider: .

    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.