Computation of Nash Equilibria of Attack and Defense Games on Networks

Stanislaw Kazmierowski, Marcin Dziubinski

Abstract: We consider the computation of a Nash equilibrium in attack and defense games on networks (Bloch et al. [1]). We prove that a Nash Equilibrium of the game can be computed in polynomial time with respect to the number of nodes in the network. We propose an algorithm that runs in \(O(n^4)\) time with respect to the number of nodes of the network, n.