Sequential Attacker-Defender Game on Complex Networks Considering the Cascading Failure Process

• Published in: IEEE transactions on computational social systems Vol. 9; no. 2; pp. 518 - 529
• Main Authors: Huang, Yuxuan, Wu, Jiajing, Tse, Chi K., Zheng, Zibin
• Format: Journal Article
• Language: English
• Published: Piscataway IEEE 01.04.2022; The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
• Subjects: Cascading failure; Complex networks; Flexibility; Game theory; Games; Iterative methods; Load modeling; Mathematical models; Networks; Parameters; Power system faults; Power system protection; Robustness; Search algorithms; Security; Stackelberg competition
• ISSN: 2329-924X; 2373-7476
• DOI: 10.1109/TCSS.2021.3099718

Cascading failure is a ubiquitous phenomenon that can paralyze networked systems in a short time. Many traditional studies of cascading failures have been conducted from the perspective of either an attacker or a defender. In reality, however, malicious attacks on networks are rarely a one-sided process. Instead, both the attacker and defender are actively involved. We use game theory to study the strategies of both sides in terms of an attacker-defender game on complex networks. Based on the concept of the Stackelberg competition, we propose a multiround attacker-defender game model on complex networks, allowing high flexibility in the available actions for both sides in the game. The model we propose allows the two sides to specify certain parameters of the network to attack/defend and further allocate a certain amount of resources for the attack/defense. Such flexibility allows the model to capture the actions of the attackers and defenders more precisely and simulate the attack process in a more realistic manner. We propose an iterative search algorithm to search for desirable strategies with systematic experiments on various types of networks and associated parameters and in terms of different relative resource owned by the attacker and defender.