The Multiplayer Colonel Blotto Game

@article{BoixAdser2020TheMC,
  title={The Multiplayer Colonel Blotto Game},
  author={Enric Boix-Adser{\`a} and Benjamin L. Edelman and Siddhartha V. Jayanti},
  journal={Proceedings of the 21st ACM Conference on Economics and Computation},
  year={2020}
}
We initiate the study of the natural multiplayer generalization of the classic continuous Colonel Blotto game.The two-player Blotto game, introduced by Borel as a model of resource competition across nsimultaneous fronts, has been studied extensively for a century and seen numerous applications throughout the social sciences. Our work defines the multiplayer Colonel Blotto gameand derives Nash equilibria for various settings of k(number of players) and n(number of battlefields)---in particular… 
Nash Equilibria of The Multiplayer Colonel Blotto Game on Arbitrary Measure Spaces
TLDR
The classical theory is extended to study multiplayer Blotto games over arbitrary measurable battlegrounds, an algorithm is provided to efficiently sample equilibria of symmetric “equipartionable” Generalized Blottogames, and the symmetric fair equilibrio of the Blotto game over the unit interval is characterized.
Colonel Blotto Games with Favoritism: Competitions with Pre-allocations and Asymmetric Effectiveness
TLDR
It is proved the existence of a set of optimal univariate distributions---which serve as candidate marginals for an equilibrium---of the Colonel Blotto game with favoritism and an algorithm is proposed to efficiently compute an approximation of the proposed optimalunivariate distributions with arbitrarily small error.
A General Lotto game with asymmetric budget uncertainty
TLDR
It is found the optimal randomized assignment strategy can actually improve the commander’s payoff two-fold when compared to optimal deterministic assignments, and four-fold in settings where the commander also pays a per-unit cost for resources.
Comments on Quantization and experimental realization of the Colonel Blotto game
  • J. Naskar
  • Computer Science
    Quantum Inf. Process.
  • 2020
TLDR
This note focuses on an exemplary case where the quantum payoff does not agree with the classical payoff at classical limits, i.e., when both players play classical strategies.
Strategically revealing intentions in General Lotto games
TLDR
Interestingly, this paper highlights many scenarios where strategically revealing intentions can actually significantly improve one’s payoff, which runs contrary to the conventional wisdom that randomness should be a central component of decision-making in adversarial environments.
Quantum Multiplayer Colonel Blotto Game.
TLDR
It is found that players with access to the quantum strategies has a advantage over the classical ones and the payoff is invariant under the order of the strategies.
An Efficient Approximation Algorithm for the Colonel Blotto Game
In the storied Colonel Blotto game, two colonels allocate a and b troops, respectively, to k distinct battlefields. A colonel wins a battle if they assign more troops to that particular battle, and
Sample-based Approximation of Nash in Large Many-Player Games via Gradient Descent
TLDR
The lack of local convergence guarantees for biased gradient descent prevents guaranteed convergence to Nash, however, it is demonstrated the ability of this approach to approximate a unique Nash equilibrium in normal-form games with as many as seven players and twenty one actions that are orders of magnitude larger than those possible with prior algorithms.
Approximate Equilibria in Generalized Colonel Blotto and Generalized Lottery Blotto Games
TLDR
A simply-constructed class of strategies are proposed and it is proved that they are approximate equilibria of the Generalized Colonel Blotto game; moreover, the approximation error is characterized according to the game's parameters.

References

SHOWING 1-10 OF 43 REFERENCES
From Duels to Battlefields: Computing Equilibria of Blotto and Other Games
TLDR
The approach provably extends the class of dueling games for which equilibria can be computed, and introduces a new dueling game, the matching duel, on which prior methods fail to be computationally feasible but upon which the authors' reduction can be applied.
The heterogeneous Colonel Blotto game
  • G. Schwartz, P. Loiseau, S. Sastry
  • Computer Science, Engineering
    2014 7th International Conference on NETwork Games, COntrol and OPtimization (NetGCoop)
  • 2014
TLDR
This paper proposes a solution of the heterogeneous Colonel Blotto game with asymmetric players and heterogeneous battlefield values, under the assumption that there is a sufficient number of battlefields of each possible value relative to the players' resources asymmetry.
Optimal Strategies of Blotto Games: Beyond Convexity
TLDR
It is shown through a set of structural results that the solution space can, interestingly, be partitioned into polynomially many disjoint convex polytopes that can be considered independently.
The non-constant-sum Colonel Blotto game
The Colonel Blotto game is a two-player constant-sum game in which each player simultaneously distributes his fixed level of resources across a set of contests. In the traditional formulation of the
Generalizations of the General Lotto and Colonel Blotto Games
In this paper, we generalize the General Lotto game and the Colonel Blotto game to allow for battlefield valuations that are heterogeneous across battlefields and asymmetric across players, and for
Two Notes on the Blotto Game
We exhibit a new equilibrium of the classic Blotto game in which players allocate one unit of resources among three coordinates and try to defeat their opponent in two out of three. It is well known
Faster and Simpler Algorithm for Optimal Strategies of Blotto Game
TLDR
This paper provides the first polynomial-size LP formulation of the optimal strategies for the Colonel Blotto game, and uses linear extension techniques to project the strategy space polytope to a higher dimensional space, which results in a lower number of facets for thepolytope.
The Colonel Blotto game
In the Colonel Blotto game, two players simultaneously distribute forces across n battlefields. Within each battlefield, the player that allocates the higher level of force wins. The payoff of the
N-dimensional Blotto game with heterogeneous battlefield values
This paper introduces the irregular N-gon solution, a new geometric method for constructing equilibrium distributions in the Colonel Blotto game with heterogeneous battlefield values, generalising
General Blotto: games of allocative strategic mismatch
The Colonel Blotto game captures strategic situations in which players attempt to mismatch an opponent’s action. We extend Colonel Blotto to a class of General Blotto games that allow for more
...
1
2
3
4
5
...