Research map / Learning theory and algorithms / Submodular and game algorithms
Faster and Simpler Algorithm for Optimal Strategies of Blotto Game
Read the paperCheck your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| Use a polynomial-size flow-based LP with Simplex instead of the exponential-constraint Ellipsoid formulation | Colonel Blotto optimal-strategy computation · Colonel Blotto | running time / practical solvability | Helped |
| Use discrete-game payoff as a proxy for continuous-game payoff | Symmetric, auctionary Colonel Blotto · Symmetric, auctionary discrete Colonel Blotto | equilibrium payoff agreement | No clear effect |
Closest papers by meaning
- Computational Analyses of the Electoral College: Campaigning Is Hard But Approximately Manageable (AAAI 2021 · similarity 0.90)
- From Duels to Battlefields: Computing Equilibria of Blotto and Other Games (AAAI 2016 · similarity 0.89)
- Equilibria of the Colonel Blotto Games with Costs (AAAI 2025 · similarity 0.87)
- Efficient Kernelized Learning in Polyhedral Games beyond Full Information: From Colonel Blotto to Congestion Games (NeurIPS 2025 · similarity 0.81)
- Adaptive Manipulation for Coalitions in Knockout Tournaments (AAAI 2025 · similarity 0.81)
- Polynomial-Time Computation of Exact $\Phi$-Equilibria in Polyhedral Games (NeurIPS 2024 · similarity 0.80)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.