Skip to Main content Skip to Navigation
Preprints, Working Papers, ...

Efficient computation of approximate equilibria in discrete Colonel Blotto games

Abstract : The Colonel Blotto game is a famous game commonly used to model resource allocation problems in many domains ranging from security to advertising. Two players distribute a fixed budget of resources on multiple battlefields to maximize the aggregate value of battlefields they win, each battlefield being won by the player who allocates more resources to it. The continuous version of the game—where players can choose any fractional allocation—has been extensively studied, albeit only with partial results to date. Recently, the discrete version—where allocations can only be integers—started to gain traction and algorithms were proposed to compute the equilibrium in polynomial time; but these remain computationally impractical for large (or even moderate) numbers of battlefields. In this paper, we propose an algorithm to compute very efficiently an approximate equilibrium for the discrete Colonel Blotto game with many battlefields. We provide a theoretical bound on the approximation error as a function of the game's parameters. We also propose an efficient dynamic programming algorithm in order to compute for each game instance the actual value of the error. We perform numerical experiments that show that the proposed strategy provides a fast and good approximation to the equilibrium even for moderate numbers of battlefields.
Document type :
Preprints, Working Papers, ...
Complete list of metadatas

Cited literature [30 references]  Display  Hide  Download
Contributor : Dong Quan Vu <>
Submitted on : Monday, May 7, 2018 - 3:51:32 PM
Last modification on : Thursday, July 9, 2020 - 9:45:19 AM
Document(s) archivé(s) le : Tuesday, September 25, 2018 - 5:08:47 PM


Files produced by the author(s)


  • HAL Id : hal-01787505, version 1



Dong Quan Vu, Patrick Loiseau, Alonso Silva. Efficient computation of approximate equilibria in discrete Colonel Blotto games. 2018. ⟨hal-01787505⟩



Record views


Files downloads