Abstract
A class of integer-valued allocation games-"General Lotto games"-is introduced and solved. The results are then applied to analyze the classical discrete "Colonel Blotto games"; in particular, optimal strategies are obtained for all symmetric Colonel Blotto games.
Original language | English |
---|---|
Pages (from-to) | 441-460 |
Number of pages | 20 |
Journal | International Journal of Game Theory |
Volume | 36 |
Issue number | 3-4 |
DOIs | |
State | Published - Mar 2008 |