Equilibria Computation of the Weakest-Link Discrete Colonel Blotto Games

Abstract

A class of Colonel Blotto Games between two agents over multiple locations are discussed. In this letter, we consider the scenario where one of the agents wins whenever she allocates more resources in all locations. We derive a theoretical result showing that mixed Nash equilibria in such games could be computed in polynomial time.