Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
175 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
42 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

The Critical Node Game (2303.05961v2)

Published 10 Mar 2023 in math.OC, cs.CR, and cs.GT

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

Definition Search Book Streamline Icon: https://streamlinehq.com
References (41)
  1. Identifying critical nodes in undirected graphs: Complexity results and polynomial algorithms for the case of bounded treewidth. Discrete Applied Mathematics, 161(16-17):2349–2360, 2013. ISSN 0166218X.
  2. Detecting critical nodes in sparse graphs. Computers & Operations Research, 36(7):2193–2200, 2009. ISSN 03050548.
  3. Nikitas Assimakopoulos. A network interdiction model for hospital infection control. Computers in Biology and Medicine, 17(6):413–422, 1987. ISSN 00104825.
  4. Multilevel approaches for the critical node problem. Operations Research, 69(2):486–508, 2021. ISSN 0030-364X, 1526-5463.
  5. Finding the most vital arcs in a network. Operations Research Letters, 8(2):73–76, 1989. ISSN 01676377.
  6. The most vital nodes with respect to independent set and vertex cover. Discrete Applied Mathematics, 159(17):1933–1946, 2011. ISSN 0166218X.
  7. Dimitris Bertsimas and Dick den Hertog. Robust and Adaptive Optimization. Dynamic Ideas LLC, 1st edition, 2022.
  8. S.P. Borgatti. Identifying sets of key players in a network. In IEMC ’03 Proceedings. Managing Technologically Driven Organizations: The Human Side of Innovation and Change (IEEE Cat. No.03CH37502), pages 127–131, Cambridge, MA, USA, 2003. IEEE. ISBN 978-0-7803-7958-9.
  9. Cloud native applications profiling using a graph neural networks approach. In 2022 IEEE Future Networks World Forum (FNWF), pages 220–227. IEEE, 2022.
  10. Defending critical infrastructure. Interfaces, 36(6):530–544, 2006. ISSN 0092-2102, 1526-551X.
  11. Existence of nash equilibria on integer programming games. In A. Ismael F. Vaz, João Paulo Almeida, José Fernando Oliveira, and Alberto Adrego Pinto, editors, Operational Research, volume 223, pages 11–23. Springer International Publishing, Cham, 2018. ISBN 978-3-319-71582-7 978-3-319-71583-4.
  12. Integer programming games: a gentle computational overview. In Tutorials in Operations Research: Advancing the Frontiers of OR/MS: From Methodologies to Applications, chapter 2, pages 31–51. INFORMS, 2023.
  13. A game theoretical framework on intrusion detection in heterogeneous networks. IEEE Transactions on Information Forensics and Security, 4(2):165–178, 2009.
  14. Efficient immunization strategies for computer networks and populations. Physical Review Letters, 91(24):247901, 2003. ISSN 0031-9007, 1079-7114.
  15. The wireless network jamming problem. Journal of Combinatorial Optimization, 14(4):481–498, 2007. ISSN 1382-6905, 1573-2886.
  16. MITRE Corporation. MITRE ATT&CK, 2023.
  17. Complexity of the critical node problem over trees. Computers & Operations Research, 38(12):1766–1774, 2011. ISSN 03050548.
  18. Gabriele Dragotto. Mathematical Programming Games. PhD thesis, Polytechnique Montréal, 2022.
  19. The ZERO regrets algorithm: Optimizing over pure nash equilibria via integer programming. INFORMS Journal on Computing, 35(5):1143–1160, 2023.
  20. Network design and defence. Games and Economic Behavior, 79:30–43, 2013.
  21. The firefighter problem: A survey of results, directions and questions. Australas. J Comb, 43:55–77, 2009.
  22. Interdiction games and monotonicity, with application to knapsack problems. INFORMS Journal on Computing, 31(2):390–410, 2019. ISSN 1091-9856, 1526-5528.
  23. Attack, defence, and contagion in networks. The Review of Economic Studies, 81(4):1518–1542, 2014.
  24. A game theoretical attack-defense model oriented to network security risk assessment. In 2008 International Conference on Computer Science and Software Engineering, volume 6, pages 498–504. IEEE, 2008.
  25. The stochastic critical node problem over trees. Networks, 76(3):381–401, 2020. ISSN 0028-3045, 1097-0037.
  26. Shortest-path network interdiction. Networks, 40(2):97–111, 2002. ISSN 0028-3045, 1097-0037.
  27. Worst-case equilibria. In Gerhard Goos, Juris Hartmanis, Jan van Leeuwen, Christoph Meinel, and Sophie Tison, editors, STACS 99, volume 1563, pages 404–413. Springer Berlin Heidelberg, Berlin, Heidelberg, 1999. ISBN 978-3-540-65691-3 978-3-540-49116-3.
  28. Rational generating functions and integer programming games. Operations Research, 59(6):1445–1460, 2011. ISSN 0030-364X, 1526-5463.
  29. The critical node detection problem in networks: A survey. Computer Science Review, 28:92–117, 2018. ISSN 15740137.
  30. Curriculum learning for multilevel budgeted combinatorial problems. In H. Larochelle, M. Ranzato, R. Hadsell, M. F. Balcan, and H. Lin, editors, Advances in Neural Information Processing Systems, volume 33, pages 7044–7056. Curran Associates, Inc., 2020.
  31. John F. Nash. Equilibrium points in n-person games. Proceedings of the National Academy of Sciences of the United States of America, 36(1):48–49, 1950.
  32. Finding the n most vital links in flow networks. Management Science, 21(5):531–539, 1975. ISSN 0025-1909, 1526-5501.
  33. A survey of game theory as applied to network security. In 2010 43rd Hawaii International Conference on System Sciences, pages 1–10, Honolulu, Hawaii, USA, 2010. IEEE. ISBN 978-1-4244-5509-6.
  34. Polynomial-time algorithms for solving a class of critical node problems on trees and series-parallel graphs. Networks, 60(2):103–119, 2012. ISSN 00283045.
  35. Exact interdiction models and algorithms for disconnecting networks via node deletions. Discrete Optimization, 9(3):172–188, 2012. ISSN 15725286.
  36. A branch-and-cut algorithm for submodular interdiction games. INFORMS Journal on Computing, 34(5):2634–2657, 2022. ISSN 1091-9856, 1526-5528.
  37. Epidemic dynamics on complex networks. Progress in Natural Science, 16(5):452–457, 2006.
  38. An integer programming framework for critical elements detection in graphs. Journal of Combinatorial Optimization, 28(1):233–273, 2014. ISSN 1382-6905, 1573-2886.
  39. R. Zenklusen. Network flow interdiction on planar graphs. Discrete Applied Mathematics, 158(13):1441–1455, 2010a. ISSN 0166218X.
  40. Rico Zenklusen. Matching interdiction. Discrete Applied Mathematics, 158(15):1676–1690, 2010b. ISSN 0166218X.
  41. Rico Zenklusen. Connectivity interdiction. Operations Research Letters, 42(6-7):450–454, 2014. ISSN 01676377.
Citations (2)
View on Semantic Scholar

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now
X Twitter Logo Streamline Icon: https://streamlinehq.com

Tweets