Abstract
Several problems of dynamic systems control can be reduced to geometric games. The problem of stabilization is an example. In this paper, the criteria of a saddle point in a geometric game is proved under more general conditions than earlier. Algorithms for finding a saddle point are given in cases where the strategy set of one of the players is (1) a ball in ℝ n , (2) a closed interval, (3) a polyhedral, and the strategy set of the other player is an arbitrary convex set.
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.
