On optimality criteria for dynamic programs with long finite horizons
From MaRDI portal
Publication:1142160
DOI10.1016/0022-247X(80)90072-4zbMath0438.90100MaRDI QIDQ1142160
Publication date: 1980
Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)
optimality criteriapenalty costsfinite action spacecountable state spaceconvergence behavioropportunity costsBlackwell-optimalchoice of horizondynamic programsinfinite horizon dynamic programminglong finite horizonsstrong 1-optimalitystrong average optimalitystrong overtaking optimality
Related Items (12)
LP based upper and lower bounds for Cesàro and Abel limits of the optimal values in problems of control of stochastic discrete time systems ⋮ On fractional flow models and equivalent finite state processes ⋮ Strong 1-optimal stationary policies in denumerable Markov decision processes ⋮ Value iteration in average cost Markov control processes on Borel spaces ⋮ Optimal steady states, excessive functions, and deterministic dynamic programs ⋮ Average cost Markov decision processes: Optimality conditions ⋮ Computing efficient steady state policies for deterministic dynamic programs. I ⋮ On strong average optimality of Markov decision processes with unbounded costs ⋮ Denumerable controlled Markov chains with average reward criterion: Sample path optimality ⋮ A note on controlled diffusions with long finite horizon ⋮ Discount-sensitive equilibria in zero-sum stochastic differential games ⋮ Unnamed Item
Cites Work
- Unnamed Item
- Estimates for finite-stage dynamic programs
- Conditions for the equivalence of optimality criteria in dynamic programming
- Averaging vs. discounting in dynamic programming: a counterexample
- On the set of optimal policies in discrete dynamic programming
- Steady State Policies for Deterministic Dynamic Programs
- The asymptotic behaviour of the minimal total expected cost for the denumerable state Markov decision model
- Overtaking Optimality for Markov Decision Chains
- Discrete Dynamic Programming
- Discounted Dynamic Programming
- On the Iterative Method of Dynamic Programming on a Finite Space Discrete Time Markov Process
- Negative Dynamic Programming
- On Finding Optimal Policies in Discrete Dynamic Programming with No Discounting
- Non-Discounted Denumerable Markovian Decision Models
- An Optimality Condition for Discrete Dynamic Programming with no Discounting
- Letter to the Editor—Criterion Equivalence in Discrete Dynamic Programming
- Turnpike Theory in Deterministic Discrete Dynamic Programming with Discount Factor Greater than One
This page was built for publication: On optimality criteria for dynamic programs with long finite horizons
