Safe Opponent Exploitation in Colonel Blotto: Where the Gifts Are, and What They Are Worth

We study safe opponent exploitation in discrete Colonel Blotto games with heterogeneous battlefield values. We investigate the characterization of gifts: pure opponent allocations which are not the best response to at least one equilibrium strategy and hence can be exploited without losing the equilibrium safety guarantee. First, we establish, for an even number of equal-value battlefields, a paired equilibrium construction under the weaker divisibility condition $n\mid 2B$, rather than $n\mid B$, and hence we derive the corresponding gift boundary $\max_j\;X_j>2B/n$. We then show that the natural extension of this boundary to heterogeneous battlefields is not universally valid by giving an exact counterexample. We also provide a sufficient condition on equilibrium marginals and their coupling under which the boundary is recovered. Finally using best response oracles and constraint generation over the equilibrium polytope, we apply our equilibrium and safe exploitation framework to five public Riddler Blotto populations, quantifying the tradeoff between unconstrained exploitation and exploitation subject to the equilibrium safety guarantee.