Approximate Equilibria in Non-constant-sum Colonel Blotto and Lottery Blotto Games with Large Numbers of Battlefields
In the Colonel Blotto game, two players with a fixed budget simultaneously allocate their resources across n battlefields to maximize the aggregate value gained from the battlefields where they have the higher allocation. Despite its long-standing history and important applicability, the Colonel Blotto game still lacks a complete Nash equilibrium characterization in its most general form-the non-constant-sum version with asymmetric players and heterogeneous battlefields. In this work, we propose a simply-constructed class of strategies-the independently uniform strategies-and we prove them to be approximate equilibria of the non-constant-sum Colonel Blotto game; moreover, we also characterize the approximation error according to the game's parameters. We also introduce an extension called the Lottery Blotto game, with stochastic winner-determination rules allowing more flexibility in modeling practical contexts. We prove that the proposed strategies are also approximate equilibria of the Lottery Blotto game.
READ FULL TEXT