Quantum Multiplayer Colonel Blotto Game
J. Naskar, A.C. Maioli

TL;DR
This paper introduces a quantum version of the multiplayer Colonel Blotto game, demonstrating that quantum strategies provide players with an advantage over classical strategies, with invariant payoffs regardless of strategy order.
Contribution
The work presents the first quantum adaptation of the multiplayer Colonel Blotto game, highlighting quantum strategies' advantage and payoff invariance.
Findings
Quantum strategies outperform classical strategies.
Payoffs remain invariant under strategy order.
First quantum formulation of the multiplayer Colonel Blotto game.
Abstract
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 strategies.
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.
Taxonomy
TopicsQuantum Mechanics and Applications · Quantum Information and Cryptography · Quantum Computing Algorithms and Architecture
