Abstract
In this chapter we study turnpike properties of approximate solutions for a class of dynamic discrete-time two-player zero-sum games with convexity–concavity assumptions. These properties describe the structure of approximate solutions which is independent of the length of the interval, for all sufficiently large intervals. We also study the existence of equilibria over an infinite horizon employing a version of the overtaking optimality criterion.
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
Aubin JP, Ekeland I (1984) Applied nonlinear analysis. Wiley Interscience, New York
Reich S, Zaslavski AJ (2014) Genericity in nonlinear analysis. Springer, New York
Zaslavski AJ (2010) Optimization on metric and normed spaces. Springer, New York
Zaslavski AJ (2012) Existence and turnpike properties of solutions of dynamic discrete time zero-sum games. Commun Appl Anal 16:261–276
Zaslavski AJ (2014) Turnpike theory for dynamic zero-sum games. In: Proceedings of the workshop “Variational and optimal control problems on unbounded domains”, Haifa, 2012. Contemporary mathematics, vol. 619, pp 225–247
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). Nonautonomous Games with 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_7
Download citation
DOI: https://doi.org/10.1007/978-3-319-52932-5_7
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)