Asymptotic properties of optimal trajectories in dynamic programming
From MaRDI portal
Abstract: We prove in a dynamic programming framework that uniform convergence of the finite horizon values implies that asymptotically the average accumulated payoff is constant on optimal trajectories. We analyze and discuss several possible extensions to two-person games.
Recommendations
Cites work
- A first course on zero-sum repeated games
- A Uniform Tauberian Theorem in Dynamic Programming
- A uniform Tauberian theorem in optimal control
- Asymptotic properties in dynamic programming
- scientific article; zbMATH DE number 2202818 (Why is no real title available?)
- The Value of Markov Chain Games with Lack of Information on One Side
Cited in
(15)- Magistral properties of optimal trajectories in the continuous optimization problem
- Asymptotic properties in dynamic programming
- Two characterizations of optimality in dynamic programming
- Constant payoff in zero-sum stochastic games
- scientific article; zbMATH DE number 3855854 (Why is no real title available?)
- scientific article; zbMATH DE number 4135674 (Why is no real title available?)
- scientific article; zbMATH DE number 4170669 (Why is no real title available?)
- scientific article; zbMATH DE number 3927763 (Why is no real title available?)
- A Uniform Tauberian Theorem in Dynamic Programming
- Preface: Special issue in honor of the 60th birthday of Sylvain Sorin
- scientific article; zbMATH DE number 4195732 (Why is no real title available?)
- Zero-sum repeated games: recent advances and new links with differential games
- A formula for the value of a stochastic game
- Constant payoff property in zero-sum stochastic games with a finite horizon
- Limit optimal trajectories in zero-sum stochastic games
This page was built for publication: Asymptotic properties of optimal trajectories in dynamic programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2431020)