On theory and algorithms for Markov decision problems with the total reward criterion
type: Item
instance of: scholarly article
title: On theory and algorithms for Markov decision problems with the total reward criterion
zbMATH Open document ID: 0443.90108
DOI: 10.1007/BF01719273
published in: OR Spektrum
publication date: 1979-01-01T00:00:00Z
Mathematics Subject Classification ID: 90C40
Mathematics Subject Classification ID: 90-02
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 60K15
zbMATH DE Number: 3693048
zbMATH Keywords: theory
zbMATH Keywords: algorithms
zbMATH Keywords: Markov decision problems
zbMATH Keywords: total reward criterion
zbMATH Keywords: unbounded rewards
zbMATH Keywords: successive approximation methods
zbMATH Keywords: action depending stopping times
zbMATH Keywords: survey
zbMATH Keywords: existence results
zbMATH Keywords: convergence results
author: J. A. E. E. Van Nunen
author: J. Wessels
MaRDI profile type: Publication
cites work: Discounted Dynamic Programming
cites work: Contraction Mappings in the Theory Underlying Dynamic Programming
cites work: A Note on Memoryless Rules for Controlling Sequential Control Processes
cites work: Q3914787
cites work: Discrete Dynamic Programming with Unbounded Rewards
cites work: Q4193284
cites work: Markov Strategies in Dynamic Programming
cites work: Markov decision processes and strongly excessive functions
cites work: Q4192588
cites work: Q4189720
cites work: Q4771778
cites work: Persistently optimal plans for nonstationary dynamic programming: The topology of weak convergence case
cites work: Decision Problems with Expected Utility Critera, I: Upper and Lower Convergent Utility
cites work: On Dynamic Programming with Unbounded Rewards
cites work: Applying a New Device in the Optimization of Exponential Queuing Systems
cites work: A modified dynamic programming method for Markovian decision problems
cites work: Letter to the Editor—A Test for Suboptimal Actions in Markovian Decision Problems
cites work: Technical Note—Undiscounted Markov Renewal Programming Via Modified Successive Approximations
cites work: Q5509984
cites work: Q4190426
cites work: Q4128290
cites work: A set of successive approximation methods for discounted Markovian decision problems
cites work: Action-dependent stopping times and Markov decision process with unbounded rewards
cites work: Successive approximations for Markov decision processes and Markov games with unbounded rewards
cites work: Q4173219
cites work: Note—A Note on Dynamic Programming with Unbounded Rewards
cites work: On the Existence of Stationary Optimal Strategies
cites work: Bounds and Transformations for Discounted Finite Markov Decision Chains
cites work: Solution of a Markovian decision problem by successive overrelaxation
cites work: Bayesian dynamic programming
cites work: Q5615108
cites work: Conditions for optimality in dynamic programming and for the limit of n-stage optimal policies to be optimal
cites work: Technical Note—An Equivalence Between Continuous and Discrete Time Markov Decision Processes
cites work: Negative Dynamic Programming
cites work: Markov programming by successive approximations with respect to weighted supremum norms
full work available at URL: https://doi.org/10.1007/bf01719273
OpenAlex ID: W2002346494
description: scientific article; zbMATH DE number 3693048