Abstract
A discrete zero-sum two-person game of breaking attacks at defended posts (a Blotto game) is considered. An algorithm for finding a game solution in mixed strategies is described and generalized to games with budget constraints. In particular cases, explicit formulas for the value of the game and optimal strategies are obtained.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
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 callMore From: Moscow University Computational Mathematics and Cybernetics
Paper Title
Journal
Date
