On the Nash equilibria of a timed asymmetric skirmish

In this work, we present a Nash equilibrium solution for a timed, asymmetric skirmish between two agents: an attacker, and a defender. We derive a solution by focusing on strategy profiles in which both the attacker and defender randomize their actions, which correspond to times, over a common atomic support. We show this class of strategies admits a unique mixed-strategy Nash equilibrium and give an algorithm for its computation. A numerical example highlights interesting features of a typical equilibrium strategy profile.