The Asymptotic Behavior of Undiscounted Value Iteration in Markov Decision Problems
From MaRDI portal
Publication:4187617
DOI10.1287/moor.2.4.360zbMath0402.90098OpenAlexW2128857696MaRDI QIDQ4187617
Awi Federgruen, Paul J. Schweitzer
Publication date: 1977
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/e8f7193b21b6805928c07cbebc8fd09eb6bfff42
Related Items (18)
Dual bounds on the equilibrium distribution of a finite Markov chain ⋮ A methodology for computation reduction for specially structured large scale Markov decision problems ⋮ Contraction mappings underlying undiscounted Markov decision problems. II ⋮ Computing transience bounds of emergency call centers: a hierarchical timed Petri net approach ⋮ A Brouwer fixed-point mapping approach to communicating Markov decision processes ⋮ Connectedness conditions used in finite state Markov decision processes ⋮ Nonstationary Markov decision problems with converging parameters ⋮ The method of value oriented successive approximations for the average reward Markov decision process ⋮ Unnamed Item ⋮ Separable value functions for infinite horizon average reward Markov decision processes ⋮ A value iteration method for undiscounted multichain Markov decision processes ⋮ Markov decision processes ⋮ Illustrated review of convergence conditions of the value iteration algorithm and the rolling horizon procedure for average-cost MDPs ⋮ Contraction mappings underlying undiscounted Markov decision problems ⋮ Value iteration in countable state average cost Markov decision processes with unbounded costs ⋮ Spectral theorem for convex monotone homogeneous maps, and ergodic control ⋮ Piecewise Affine Dynamical Models of Petri Nets – Application to Emergency Call Centers* ⋮ Optimal pricing for a \(\mathrm{GI}/\mathrm{M}/k/N\) queue with several customer types and holding costs
This page was built for publication: The Asymptotic Behavior of Undiscounted Value Iteration in Markov Decision Problems
