Pure strategy Nash equilibria in non-zero sum colonel Blotto games

We analyze a Colonel Blotto game in which opposing parties have differing relative intensities (i.e. the game is non-zero sum). We characterize the colonels' payoffs that sustain a pure strategy equilibrium and present an algorithm that reaches the equilibrium actions (when they exist). Finally we show that the set of games with a pure strategy equilibria is non-empty.