Computation of Nash Equilibria of Attack and Defense Games on Networks

Stanisław Kaźmierowski; Marcin Dziubiński

doi:10.1007/978-3-031-43254-5_1

paper

Computation of Nash Equilibria of Attack and Defense Games on Networks

arXiv:2309.04288 · doi:10.1007/978-3-031-43254-5_1

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(n4) time with respect to the number of nodes of the network, n.

arXiv commentPresented at SAGT-2023