Related papers: The Multiplayer Colonel 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…
Blotto Games are a popular model of multi-dimensional strategic resource allocation. Two players allocate resources in different battlefields in an auction setting. While competition with equal budgets is well understood, little is known…
Social media platforms are responsible for collecting and disseminating vast quantities of content. Recently, however, they have also begun enlisting users in helping annotate this content - for example, to provide context or label…
Many efficient algorithms have been designed to recover Nash equilibria of various classes of finite games. Special classes of continuous games with infinite strategy spaces, such as polynomial games, can be solved by semidefinite…
Colonel Blotto games with discrete strategy spaces effectively illustrate the intricate nature of multidimensional strategic reasoning. This paper studies the equilibrium set of such games where, in line with prior experimental work, the…
A variety of social, economic, and political interactions have long been modelled after Blotto games. In this paper, we introduce a general model of dynamic $n$-player Blotto contests. The players have asymmetric resources, and the…
We study equilibrium strategies and the value of the asymmetric variant of the discrete Colonel Blotto game with $K \geq 2$ battlefields, $B \geq 1$ resources of the weaker player and $A > B$ resources of the stronger player. We derive…
In this paper, we investigate informational asymmetries in the Colonel Blotto game, a game-theoretic model of competitive resource allocation between two players over a set of battlefields. The battlefield valuations are subject to…
This paper provides theoretical bounds for empirical game theoretical analysis of complex multi-agent interactions. We provide insights in the empirical meta game showing that a Nash equilibrium of the meta-game is an approximate Nash…
In this work we successfully present a quantum version of the multiplayer Colonel Blotto game. We find that players with access to the quantum strategies has a advantage over the classical ones. The payoff is invariant under the order of…
The Prisoner's Dilemma, zero-sum games, LQR team problems, and differential games have shaped game theory in controls for decades, but the field's most pressing adversarial challenges demand a richer framework, and its name is Colonel…
The Colonel Blotto game is a renowned resource allocation problem with a long-standing literature in game theory (almost 100 years). However, its scope of application is still restricted by the lack of studies on the incomplete-information…
The General Lotto game is a popular variant of the famous Colonel Blotto game, in which two opposing players allocate limited resources over many battlefields. In this paper, we consider incomplete and asymmetric information formulations…
Resource allocation problems across multiple contests are ubiquitous in adversarial settings, from military operations to market competition. While Colonel Blotto and General Lotto games have provided valuable theoretical foundations for…
In order to understand if and how strategic resource allocation can constrain the structure of pair-wise competition outcomes in competitive human competitions we introduce a new multiplayer resource allocation game, the Population Lotto…
This paper introduces a novel class of multi-stage resource allocation games that model real-world scenarios in which profitability depends on the balance between supply and demand, and where higher resource investment leads to greater…
When a centrally operated ride-hailing company considers to enter a market already served by another company, it has to make a strategic decision about how to distribute its fleet among different regions in the area. This decision will be…
This work addresses competitive resource allocation in a sequential setting, where two players allocate resources across objects or locations of shared interest. Departing from the simultaneous Colonel Blotto game, our framework introduces…
We consider a game in which each player must find a compromise between more daring strategies that carry a high risk for him to be eliminated, and more cautious ones that, however, reduce his final score. For two symmetric players this game…
We study the problem of game-theoretic robot allocation where two players strategically allocate robots to compete for multiple sites of interest. Robots possess offensive or defensive capabilities to interfere and weaken their opponents to…