Discrete Colonel Blotto and General Lotto Games
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.
(This abstract was borrowed from another version of this item.)
When requesting a correction, please mention this item's handle: RePEc:cla:levrem:321307000000000532. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (David K. Levine)
If references are entirely missing, you can add them using this form.