Abstract
In this chapter we study the structure of approximate solutions for a class of unconstrained dynamic discrete-time two-player zero-sum games without using standard convexity–concavity assumptions and establish two turnpike results. These results describe the structure of approximate solutions which is independent of the length of domains.
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 (2006) Turnpike properties in the calculus of variations and optimal control. Springer, New York
Zaslavski AJ (2014) Turnpike properties of approximate solutions of nonconcave discrete-time optimal control problems. J Convex Anal 21:681–701
Zaslavski AJ (2014) Turnpike phenomenon and infinite horizon optimal control. Springer optimization and its applications. Springer, New York
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). Unconstrained 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_5
Download citation
DOI: https://doi.org/10.1007/978-3-319-52932-5_5
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)