IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v47y2024i5d10.1007_s10878-024-01173-3.html
   My bibliography  Save this article

The critical node game

Author

Listed:
  • Gabriele Dragotto

    (Princeton University)

  • Amine Boukhtouta

    (Ericsson Canada Inc.)

  • Andrea Lodi

    (Cornell Tech and Technion - IIT)

  • Mehdi Taobane

    (Polytechnique Montréal)

Abstract

In this work, we introduce a game-theoretic model that assesses the cyber-security risk of cloud networks and informs security experts on the optimal security strategies. Our approach combines game theory, combinatorial optimization, and cyber-security and aims to minimize the unexpected network disruptions caused by malicious cyber-attacks under uncertainty. Methodologically, we introduce the the critical node game, a simultaneous and non-cooperative attacker-defender game where each player solves a combinatorial optimization problem parametrized in the variables of the other player. Each player simultaneously commits to a defensive (or attacking) strategy with limited knowledge about the choices of their adversary. We provide a realistic model for the critical node game and propose an algorithm to compute its stable solutions, i.e., its Nash equilibria. Practically, our approach enables security experts to assess the security posture of the cloud network and dynamically adapt the level of cyber-protection deployed on the network. We provide a detailed analysis of a real-world cloud network and demonstrate the efficacy of our approach through extensive computational tests.

Suggested Citation

  • Gabriele Dragotto & Amine Boukhtouta & Andrea Lodi & Mehdi Taobane, 2024. "The critical node game," Journal of Combinatorial Optimization, Springer, vol. 47(5), pages 1-20, July.
  • Handle: RePEc:spr:jcomop:v:47:y:2024:i:5:d:10.1007_s10878-024-01173-3
    DOI: 10.1007/s10878-024-01173-3
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-024-01173-3
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s10878-024-01173-3?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. Clayton W. Commander & Panos M. Pardalos & Valeriy Ryabchenko & Stan Uryasev & Grigoriy Zrazhevsky, 2007. "The wireless network jamming problem," Journal of Combinatorial Optimization, Springer, vol. 14(4), pages 481-498, November.
    2. 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.
    3. H. Donald Ratliff & G. Thomas Sicilia & S. H. Lubore, 1975. "Finding the n Most Vital Links in Flow Networks," Management Science, INFORMS, vol. 21(5), pages 531-539, January.
    4. Matthias Köppe & Christopher Thomas Ryan & Maurice Queyranne, 2011. "Rational Generating Functions and Integer Programming Games," Operations Research, INFORMS, vol. 59(6), pages 1445-1460, December.
    5. Gabriele Dragotto & Rosario Scatamacchia, 2023. "The Zero Regrets Algorithm: Optimizing over Pure Nash Equilibria via Integer Programming," INFORMS Journal on Computing, INFORMS, vol. 35(5), pages 1143-1160, September.
    6. Dziubiński, Marcin & Goyal, Sanjeev, 2013. "Network design and defence," Games and Economic Behavior, Elsevier, vol. 79(C), pages 30-43.
    7. Matteo Fischetti & Ivana Ljubić & Michele Monaci & Markus Sinnl, 2019. "Interdiction Games and Monotonicity, with Application to Knapsack Problems," INFORMS Journal on Computing, INFORMS, vol. 31(2), pages 390-410, April.
    8. Alexander Veremyev & Oleg A. Prokopyev & Eduardo L. Pasiliao, 2014. "An integer programming framework for critical elements detection in graphs," Journal of Combinatorial Optimization, Springer, vol. 28(1), pages 233-273, July.
    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. 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. Andrea Baggio & Margarida Carvalho & Andrea Lodi & Andrea Tramontani, 2021. "Multilevel Approaches for the Critical Node Problem," Operations Research, INFORMS, vol. 69(2), pages 486-508, March.
    3. Billand, Pascal & Bravard, Christophe & Iyengar, Sitharama S. & Kumar, Rajnish & Sarangi, Sudipta, 2016. "Network connectivity under node failure," Economics Letters, Elsevier, vol. 149(C), pages 164-167.
    4. Daniel Woods & Mustafa Abdallah & Saurabh Bagchi & Shreyas Sundaram & Timothy Cason, 2022. "Network defense and behavioral biases: an experimental study," Experimental Economics, Springer;Economic Science Association, vol. 25(1), pages 254-286, February.
    5. Cerulli, Martina & Serra, Domenico & Sorgente, Carmine & Archetti, Claudia & Ljubić, Ivana, 2023. "Mathematical programming formulations for the Collapsed k-Core Problem," European Journal of Operational Research, Elsevier, vol. 311(1), pages 56-72.
    6. Bloch, Francis & Dutta, Bhaskar & Dziubiński, Marcin, 2020. "A game of hide and seek in networks," Journal of Economic Theory, Elsevier, vol. 190(C).
    7. Hosseinali Salemi & Austin Buchanan, 2022. "Solving the Distance-Based Critical Node Problem," INFORMS Journal on Computing, INFORMS, vol. 34(3), pages 1309-1326, May.
    8. Crönert, Tobias & Martin, Layla & Minner, Stefan & Tang, Christopher S., 2024. "Inverse optimization of integer programming games for parameter estimation arising from competitive retail location selection," European Journal of Operational Research, Elsevier, vol. 312(3), pages 938-953.
    9. Beck, Yasmine & Ljubić, Ivana & Schmidt, Martin, 2023. "A survey on bilevel optimization under uncertainty," European Journal of Operational Research, Elsevier, vol. 311(2), pages 401-426.
    10. Bravard, Christophe & Charroin, Liza & Touati, Corinne, 2017. "Optimal design and defense of networks under link attacks," Journal of Mathematical Economics, Elsevier, vol. 68(C), pages 62-79.
    11. Britta Hoyer & Kris De Jaegher, 2023. "Network disruption and the common-enemy effect," International Journal of Game Theory, Springer;Game Theory Society, vol. 52(1), pages 117-155, March.
    12. Foad Mahdavi Pajouh, 2020. "Minimum cost edge blocker clique problem," Annals of Operations Research, Springer, vol. 294(1), pages 345-376, November.
    13. Haller, Hans & Hoyer, Britta, 2019. "The common enemy effect under strategic network formation and disruption," Journal of Economic Behavior & Organization, Elsevier, vol. 162(C), pages 146-163.
    14. Konrad, Kai A. & Morath, Florian, 2023. "How to preempt attacks in multi-front conflict with limited resources," European Journal of Operational Research, Elsevier, vol. 305(1), pages 493-500.
    15. Marco Di Summa & Syed Md Omar Faruk, 2023. "Critical node/edge detection problems on trees," 4OR, Springer, vol. 21(3), pages 439-455, September.
    16. Nora, Vladyslav & Uno, Hiroshi, 2014. "Saddle functions and robust sets of equilibria," Journal of Economic Theory, Elsevier, vol. 150(C), pages 866-877.
    17. Gokhan Karakose & Ronald G. McGarvey, 2019. "Optimal Detection of Critical Nodes: Improvements to Model Structure and Performance," Networks and Spatial Economics, Springer, vol. 19(1), pages 1-26, March.
    18. Alice Paul & Susan E. Martonosi, 2024. "The all-pairs vitality-maximization (VIMAX) problem," Annals of Operations Research, Springer, vol. 338(2), pages 1019-1048, July.
    19. Belhaj, Mohamed & Deroïan, Frédéric, 2018. "Targeting the key player: An incentive-based approach," Journal of Mathematical Economics, Elsevier, vol. 79(C), pages 57-64.
    20. Bernardetta Addis & Roberto Aringhieri & Andrea Grosso & Pierre Hosteins, 2016. "Hybrid constructive heuristics for the critical node problem," Annals of Operations Research, Springer, vol. 238(1), pages 637-649, 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:spr:jcomop:v:47:y:2024:i:5:d:10.1007_s10878-024-01173-3. 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.