Generalized Colonel Blotto Game
Aidin Ferdowsi, Anibal Sanjab, Walid Saad, and Tamer Ba\c{s}ar

TL;DR
This paper introduces a generalized Colonel Blotto game that produces deterministic, practical equilibrium strategies accounting for battlefield heterogeneity and resource consumption, enhancing analysis of competitive resource allocation.
Contribution
It proposes a new generalized Blotto game model with analytical equilibrium strategies, addressing limitations of classical models in real-world scenarios.
Findings
Existence of pure-strategy Nash equilibrium is proven.
Closed-form equilibrium strategies are derived.
Resource-rich players can secure higher payoffs at equilibrium.
Abstract
Competitive resource allocation between adversarial decision makers arises in a wide spectrum of real-world applications such as in communication systems, cyber-physical systems security, as well as financial, political, and electoral competition. As such, developing analytical tools to model and analyze competitive resource allocation is crucial for devising optimal allocation strategies and anticipating the potential outcomes of the competition. To this end, the Colonel Blotto game is one of the most popular game-theoretic frameworks for modeling and analyzing such competitive resource allocation problems. However, in many real-world competitive situations, the Colonel Blotto game does not admit solutions in deterministic strategies and, hence, one must rely on analytically complex mixed-strategies with their associated tractability, applicability, and practicality challenges. In this…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
