Optimal Attack Strategy to a Network Consisting of Interdependent Subnetworks

This paper analyzes the optimal strategies for the attacker in an attack-defense game on a network consisting of interdependent subnetworks. The defender moves first and evenly allocates the scarce resource to protect the network nodes. The attacker moves after observing the actions taken by the defender, allocating its limited resources to attack the network nodes. Binary Decision Diagram is employed to obtain all potential states of a given interdependent network after attack. For each of the defender's given strategies, the attacker tries to maximize its cumulative prospect value considering all possible outcomes. Illustrative example is solved to show the applications