Constrained Games with Convexity–Concavity Assumptions

Alexander J. Zaslavski
Additional contact information
Alexander J. Zaslavski: The Technion – Israel Institute of Technology

Chapter 8 in Discrete-Time Optimal Control and Games on Large Intervals, 2017, pp 303-389 from Springer

Abstract: Abstract In this chapter we study the existence and turnpike properties of approximate solutions for a class of dynamic constrained discrete-time two-player zero-sum games which satisfy 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 intervals and endpoint conditions. We show that the turnpike phenomenon is stable under small perturbations of objective functions and analyze the structure of approximate solutions in regions closed to the endpoints of domains.

Date: 2017
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:spochp:978-3-319-52932-5_8

Ordering information: This item can be ordered from
http://www.springer.com/9783319529325

DOI: 10.1007/978-3-319-52932-5_8

Access Statistics for this chapter

More chapters in Springer Optimization and Its Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().