Fast and Simple Solutions of Blotto Games

DOI10.1287/OPRE.2022.2261MaRDI QIDQ6192834zbMATH OpenOpenAlexFDO

Authors Soheil Behnezhad, Sina Dehghani, Mahsa Derakhshan, S. Seddighin

Publication date 12 March 2024

Published in Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/opre.2022.2261

zbMATH Keywords

algorithmic game theoryColonel BlottoNash equilibriumzero-sum games

Mathematics Subject Classification ID

Mathematical programming (90Cxx)

Recommendations

• From duels to battlefields: computing equilibria of Blotto and other games
• Discrete Colonel Blotto and general lotto games
• The multiplayer Colonel Blotto game
• An algorithmic solution to the Blotto game using multimarginal couplings
• Discrete Colonel Blotto games with two battlefields

Cited in

(4)

• Discrete Colonel Blotto games with two battlefields
• Online learning in budget-constrained dynamic Colonel Blotto games
• An algorithmic solution to the Blotto game using multimarginal couplings
• Attack-defense game model with testing

This page was built for publication: Fast and Simple Solutions of Blotto Games

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6192834)