Equilibria of the Colonel Blotto Games with Costs
Stanislaw Kazmierowski
摘要
This paper studies a generalized variant of the Colonel Blotto game, referred to as the Colonel Blotto game with costs. Unlike the classic Colonel Blotto game, which imposes the use-it-or-lose-it budget assumption, the Colonel Blotto game with costs captures the strategic importance of costs related both to obtaining resources and assigning them across battlefields. We show that every instance of the Colonel Blotto game with costs is strategically equivalent to an instance of the zero-sum Colonel Blotto game with one additional battlefield. This enables the computation of Nash equilibria of the Colonel Blotto game with costs in polynomial time with respect to the game parameters: the number of battlefields plus the number of resources available to the players.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
相关 Paper
- Computational Analyses of the Electoral College: Campaigning Is Hard But Approximately ManageableSina Dehghani, Hamed Saleh, Saeed Seddighin, Shang-Hua TengAAAI 2021 · 被引用 2 次
- Colonel Blotto with Battlefield GamesSalam Afiouni, Jakub Cerný, Chun Kai Ling, Christian KroerAAAI 2026
- Sampling Equilibria: Fast No-Regret Learning in Structured GamesDaniel Beaglehole, Max Hopkins, Daniel Kane, Sihan Liu 等SODA 2023 · 被引用 2 次
- Efficient Kernelized Learning in Polyhedral Games beyond Full Information: From Colonel Blotto to Congestion GamesAndreas Kontogiannis, Vasilis Pollatos, Gabriele Farina, Panayotis Mertikopoulos 等NeurIPS 2025 · 被引用 2 次
- Double Oracle Algorithm for Computing Equilibria in Continuous GamesLukás Adam, Rostislav Horcík, Tomás Kasl, Tomás KroupaAAAI 2021 · 被引用 30 次
