Abstract
In this paper we treat a specific two-person, zero-sum, dynamic game of the type <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">x_{k + 1} = f(x_{k}, u_{k}, w_{k})</tex> . The optimal solutions for this game (i.e, a saddle point) have to be sought in the class of mixed (synonymously, randomized) strategies. For this particular game a theory of optimality of mixed strategies is developed and a hierarchy of problems of increasing generality, within this particular game, is solved. The specific game considered is one of the most classic of the problems in game theory. A gun is firing at a moving object. How best should the object move in order to reach a certain destination? Conversely, where should the gun fire in order to prevent the object from reaching its destination? This problem occurs in different guises in a variety of situations. The moving object could, for example, be a ship or a tank. The optimal strategies of the two palyers have perforce to be mixed.
Sign-in/Register to access full text options 
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.
