The method of value oriented successive approximations for the average reward Markov decision process
type: Item
instance of: scholarly article
title: The method of value oriented successive approximations for the average reward Markov decision process
zbMATH Open document ID: 0443.90109
DOI: 10.1007/BF01719500
author: S. H. Smith
published in: OR Spektrum
publication date: 1980-01-01T00:00:00Z
Mathematics Subject Classification ID: 90C40
Mathematics Subject Classification ID: 65K05
zbMATH DE Number: 3693049
zbMATH Keywords: value oriented successive approximations
zbMATH Keywords: average reward
zbMATH Keywords: finite state space
zbMATH Keywords: finite action space
zbMATH Keywords: almost optimal solutions
zbMATH Keywords: convergence
MaRDI profile type: Publication
cites work: Optimal decision procedures for finite Markov chains. Part II: Communicating systems
cites work: Q3245701
cites work: Q3251743
cites work: Technical Note—Bounds on the Gain of a Markov Decision Process
cites work: Technical Note—The Method of Successive Approximations and Markovian Decision Problems
cites work: Q3266141
cites work: Technical Note—Undiscounted Markov Renewal Programming Via Modified Successive Approximations
cites work: Discounting, Ergodicity and Convergence for Markov Decision Processes
cites work: A set of successive approximation methods for discounted Markovian decision problems
cites work: Q4190426
cites work: On Finding the Maximal Gain for Markov Decision Processes
cites work: Technical Note—Improved Conditions for Convergence in Undiscounted Markov Renewal Programming
cites work: Some Bounds for Discounted Sequential Decision Processes
cites work: Iterative solution of the functional equations of undiscounted Markov renewal programming
cites work: The Asymptotic Behavior of Undiscounted Value Iteration in Markov Decision Problems
cites work: Geometric convergence of value-iteration in multichain Markov decision problems
cites work: A successive approximation algorithm for an undiscounted Markov decision process
cites work: Dynamic programming, Markov chains, and the method of successive approximations
full work available at URL: https://doi.org/10.1007/bf01719500
OpenAlex ID: W2123114919
description: scientific article; zbMATH DE number 3693049