Reproduce “Efficient Equilibrium Computation in Colonel Blotto Games” on OpenResearch

Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.

Universal app for Apple silicon and Intel. Requires macOS 11 or later.

About this paper

Martin Bichler, Abheek Ghosh

The authors give an FPTAS for two-player Colonel Blotto games with arbitrary budgets and common battlefield values. The method jointly finds budget-feasible strategies and suitable marginals, preserving affordable tie-and-win deviations in the continuous game. It constructs an additive-ε Nash equilibrium in Õ(L₀+E+n*³/ε⁶) finite-bit operations; it does not cover player-specific values.

Summary by alphaXiv.

Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.