Faster and Simpler Algorithm for Optimal Strategies of Blotto Game

In the Colonel Blotto game, which was initially introduced by Borel in 1921, two colonels simultaneously distribute their troops across different battlefields. The winner of each battlefield is determined independently by a winner-take-all rule. The ultimate payoff of each colonel is the number of battlefields he wins. This game is commonly used for analyzing a wide range of applications such as the U.S presidential election, innovative technology competitions, advertisements, etc. There have been persistent efforts for finding the optimal strategies for the Colonel Blotto game. After almost a century Ahmadinejad, Dehghani, Hajiaghayi, Lucier, Mahini, and Seddighin provided a poly-time algorithm for finding the optimal strategies. They first model the problem by a Linear Program (LP) and use Ellipsoid method to solve it. However, despite the theoretical importance of their algorithm, it is highly impractical. In general, even Simplex method (despite its exponential running-time) performs better than Ellipsoid method in practice. In this paper, we provide the first polynomial-size LP formulation of the optimal strategies for the Colonel Blotto game. We use linear extension techniques. Roughly speaking, we project the strategy space polytope to a higher dimensional space, which results in a lower number of facets for the polytope. We use this polynomial-size LP to provide a novel, simpler and significantly faster algorithm for finding the optimal strategies for the Colonel Blotto game. We further show this representation is asymptotically tight in terms of the number of constraints. We also extend our approach to multi-dimensional Colonel Blotto games, and implement our algorithm to observe interesting properties of Colonel Blotto; for example, we observe the behavior of players in the discrete model is very similar to the previously studied continuous model.

[1]  Richard Bellman,et al.  On “Colonel Blotto” and Analogous Games , 1969 .

[2]  Jack Edmonds,et al.  Matroids and the greedy algorithm , 1971, Math. Program..

[3]  Jean-François Laslier,et al.  Distributive Politics and Electoral Competition , 2002, J. Econ. Theory.

[4]  Ronald L. Rivest,et al.  Introduction to Algorithms , 1990 .

[5]  R. Kipp Martin,et al.  Using separation algorithms to generate mixed integer model reformulations , 1991, Oper. Res. Lett..

[6]  B. Roberson.  The Colonel Blotto game , 2006 .

[7]  Michel X. Goemans,et al.  Smallest compact formulation for the permutahedron , 2015, Math. Program..

[8]  Lawrence Freedman.  The Problem of Strategy , 1980 .

[9]  Scott E. Page,et al.  General Blotto: games of allocative strategic mismatch , 2009 .

[10]  Roman M. Sheremeta,et al.  An experimental investigation of Colonel Blotto games , 2009, SSRN Electronic Journal.

[11]  Oliver Alfred Gross,et al.  A Continuous Colonel Blotto Game , 1950 .

[12]  D. W. Blackett.  Pure strategy solutions of blotto games , 1958 .

[13]  M. Fréchet.  Commentary on the Three Notes of Emile Borel , 1953 .

[14]  Thomas Rothvoß,et al.  Some 0/1 polytopes need exponential size extended formulations , 2011, Math. Program..

[15]  Dan Kovenock,et al.  Coalitional Colonel Blotto Games with Application to the Economics of Alliances , 2012 .

[16]  Dan Kovenock,et al.  Conflicts with Multiple Battlefields , 2010, SSRN Electronic Journal.

[17]  Michael C. Munger,et al.  In Play: A Commentary on Strategies in the 2004 U.S. Presidential Election , 2005 .

[18]  Dmitriy Kvasov,et al.  Contests with limited resources , 2007, J. Econ. Theory.

[19]  Jonathan Weinstein,et al.  Two Notes on the Blotto Game , 2012 .

[20]  Jens Vygen,et al.  The Book Review Column1 , 2020, SIGACT News.

[21]  Sergiu Hart,et al.  Discrete Colonel Blotto and General Lotto games , 2008, Int. J. Game Theory.

[22]  Hanif D. Sherali,et al.  Linear Programming and Network Flows , 1977 .

[23]  Thomas Rothvoß,et al.  The matching polytope has exponential extension complexity , 2013, STOC.

[24]  R. Myerson.  Incentives to Cultivate Favored Minorities Under Alternative Electoral Systems , 1993, American Political Science Review.

[25]  D. W. Blackett,et al.  Some blotto games , 1954 .

[26]  J. Neumann,et al.  Communication on the Borel Notes , 1953 .

[27]  É. Borel.  The Theory of Play and Integral Equations with Skew Symmetric Kernels , 1953 .

[28]  Mohammad Taghi Hajiaghayi,et al.  From Duels to Battlefields: Computing Equilibria of Blotto and Other Games , 2016, AAAI.

[29]  Mihalis Yannakakis,et al.  Expressing combinatorial optimization problems by linear programs , 1991, STOC '88.

[30]  M. Fréchet.  Emile Borel, Initiator of the Theory of Psychological Games and Its Application , 1953 .

[31]  Martin Shubik,et al.  Systems Defense Games: Colonel Blotto, Command and Control , 1981 .

[32]  Edith Cohen,et al.  Making intra-domain routing robust to changing and uncertain traffic demands: understanding fundamental tradeoffs , 2003, SIGCOMM '03.