Asymptotic Properties of Optimal Trajectories in Dynamic Programming
classification
🧮 math.OC
keywords
dynamicoptimalprogrammingtrajectoriesaccumulatedanalyzeasymptoticasymptotically
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.