The Multiplayer Colonel Blotto Game
| Autor: | Benjamin L. Edelman, Siddhartha Jayanti, Enric Boix-Adserà |
|---|---|
| Rok vydání: | 2020 |
| Předmět: |
FOS: Computer and information sciences
Economics and Econometrics Computer Science::Computer Science and Game Theory Computer science Generalization FOS: Economics and business Competition (economics) symbols.namesake Computer Science - Computer Science and Game Theory Joint probability distribution 0502 economics and business Economics - Theoretical Economics 050207 economics 05 social sciences ComputingMilieux_PERSONALCOMPUTING Full paper Constraint (information theory) Nash equilibrium symbols Theoretical Economics (econ.TH) 050206 economic theory Marginal distribution Mathematical economics Finance Computer Science and Game Theory (cs.GT) Gibbs sampling |
| Zdroj: | EC |
| DOI: | 10.1145/3391403.3399555 |
| Popis: | 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 $n$ simultaneous fronts, has been studied extensively for a century and seen numerous applications throughout the social sciences. Our work defines the multiplayer Colonel Blotto game and derives Nash equilibria for various settings of $k$ (number of players) and $n$. We also introduce a "Boolean" version of Blotto that becomes interesting in the multiplayer setting. The main technical difficulty of our work, as in the two-player theoretical literature, is the challenge of coupling various marginal distributions into a joint distribution satisfying a strict sum constraint. In contrast to previous works in the continuous setting, we derive our couplings algorithmically in the form of efficient sampling algorithms. Comment: 24 pages; minor additions to introduction |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|