On optimality criteria for dynamic programs with long finite horizons
type: Item
instance of: scholarly article
title: On optimality criteria for dynamic programs with long finite horizons
zbMATH Open document ID: 0438.90100
DOI: 10.1016/0022-247X(80)90072-4
author: James Flynn
published in: Journal of Mathematical Analysis and Applications
publication date: 1980-01-01T00:00:00Z
Mathematics Subject Classification ID: 90C40
Mathematics Subject Classification ID: 90C39
zbMATH DE Number: 3685265
zbMATH Keywords: optimality criteria
zbMATH Keywords: long finite horizons
zbMATH Keywords: dynamic programs
zbMATH Keywords: countable state space
zbMATH Keywords: finite action space
zbMATH Keywords: choice of horizon
zbMATH Keywords: convergence behavior
zbMATH Keywords: Blackwell-optimal
zbMATH Keywords: infinite horizon dynamic programming
zbMATH Keywords: strong 1-optimality
zbMATH Keywords: opportunity costs
zbMATH Keywords: penalty costs
zbMATH Keywords: strong average optimality
zbMATH Keywords: strong overtaking optimality
MaRDI profile type: Publication
cites work: Discrete Dynamic Programming
cites work: Discounted Dynamic Programming
cites work: On the Iterative Method of Dynamic Programming on a Finite Space Discrete Time Markov Process
cites work: An Optimality Condition for Discrete Dynamic Programming with no Discounting
cites work: Overtaking Optimality for Markov Decision Chains
cites work: Turnpike Theory in Deterministic Discrete Dynamic Programming with Discount Factor Greater than One
cites work: Averaging vs. discounting in dynamic programming: a counterexample
cites work: Conditions for the equivalence of optimality criteria in dynamic programming
cites work: Steady State Policies for Deterministic Dynamic Programs
cites work: Estimates for finite-stage dynamic programs
cites work: Q4177363
cites work: The asymptotic behaviour of the minimal total expected cost for the denumerable state Markov decision model
cites work: On the set of optimal policies in discrete dynamic programming
cites work: Letter to the Editor—Criterion Equivalence in Discrete Dynamic Programming
cites work: Non-Discounted Denumerable Markovian Decision Models
cites work: Negative Dynamic Programming
cites work: On Finding Optimal Policies in Discrete Dynamic Programming with No Discounting
description: scientific article; zbMATH DE number 3685265