Abstract
In this chapter we study existence and turnpike properties of approximate solutions for a class of dynamic constrained discrete-time two-player zero-sum games without using convexity–concavity assumptions. We describe the structure of approximate solutions which is independent of the length of the interval, for all sufficiently large intervals and show that approximate solutions are determined mainly by the objective function, and are essentially independent of the choice of interval and endpoint conditions.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Zaslavski AJ (1999) Turnpike property for dynamic discrete time zero-sum games. Abst Appl Anal 4:21–48
Zaslavski AJ (2011) The existence and structure of approximate solutions of dynamic discrete time zero-sum games. J Nonlinear Convex Anal 12:49–68
Zaslavski AJ (2014) Turnpike properties of approximate solutions of dynamic discrete time zero-sum games. J Dyn Games 2014:299–330
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this chapter
Cite this chapter
Zaslavski, A.J. (2017). Constrained Games Without Convexity–Concavity Assumptions. In: Discrete-Time Optimal Control and Games on Large Intervals. Springer Optimization and Its Applications, vol 119. Springer, Cham. https://doi.org/10.1007/978-3-319-52932-5_6
Download citation
DOI: https://doi.org/10.1007/978-3-319-52932-5_6
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-52931-8
Online ISBN: 978-3-319-52932-5
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)