Abstract
We consider the class of two-person zero-sum allocation games known as Captain Lotto games (Hart in Int J Game Theory 45:37–61, 2016). These are Colonel Blotto type games in which the players have capacity constraints. We consider the game with non-strict constraints, and with strict constraints. We show in most cases that when optimal strategies exist, they are necessarily unique. When they don’t exist, we characterize the pointwise limit of the cumulative distribution functions of \(\varepsilon \)-optimal strategies.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
