arXiv (All)
open access
The Complexity of Computing Nash Equilibria in Colonel Blotto Games
We study the complexity of Nash equilibrium computation in discrete Colonel Blotto games. For two-player general-sum Colonel Blotto with monotonic piecewise-constant battlefield payoffs, we show that computing an inverse-polynomial approximate Nash equilibrium is PPAD-hard, even with only two battle
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- A characterization of subgame perfect equilibria in single-leader multi-follower games#365635
- On combinatorial optimization games#1055978
- FootsiesGym: A Fighting Game Benchmark for Two-Player Zero-Sum Imperfect-Information Games#346539
- Introduction to QUDO, Tensor QUDO and HOBO formulations: Qudits, Equivalences, Knapsack Problem, Traveling Salesman Problem and Combinatorial Games#189316
- No Undesirable Equilibria, No Collisions: Combining Modulation and Control Barrier Functions for Liveness and Safety in Dynamic Collision Avoidance#1326093
Record · ID 1202375
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive