PUB - Publikationen an der Universität Bielefeld

The question how to optimally design an infrastructure network that may be subject to intelligent threats is of highest interest. We address this problem by considering a Designer-Adversary game of optimal network design for the case of imperfect node defense. In this two-stage game, first the Designer defends network connectivity by forming costly links and additionally protecting nodes. Then, the Adversary attacks a fixed number of nodes, aiming to disconnect the network. In contrast to the existing literature, defense is imperfect in the sense that defended nodes can still be destroyed with some fixed probability. We completely characterize the solution of the game for attack budgets of one and two nodes, while for larger budget we present a partial characterization of the solution. To do so, we determine the minimum number of links necessary to construct a network with any degree of connectivity and any given number of essential nodes.