Geometric convergence of value-iteration in multichain Markov decision problems
From MaRDI portal
Publication:4187616
Cited in
(18)- Dual bounds on the equilibrium distribution of a finite Markov chain
- Contraction mappings underlying undiscounted Markov decision problems. II
- A Brouwer fixed-point mapping approach to communicating Markov decision processes
- Convergence of iterates in nonlinear Perron-Frobenius theory
- A value-iteration scheme for undiscounted multichain Markov renewal programs
- MARKOV DECISION PROCESSES
- Illustrated review of convergence conditions of the value iteration algorithm and the rolling horizon procedure for average-cost MDPs
- Variational characterizations in Markov decision processes
- The method of value oriented successive approximations for the average reward Markov decision process
- Guaranteed approximation of Markov chains with applications to multiplexer engineering in ATM networks
- Piecewise affine dynamical models of Petri nets -- application to emergency call centers
- Computing transience bounds of emergency call centers: a hierarchical timed Petri net approach
- Improved iterative computation of the expected discounted return in Markov and semi-Markov chains
- Criteria for selecting the relaxation factor of the value iteration algorithm for undiscounted Markov and semi-Markov decision processes
- Asymptotic expansions for dynamic programming recursions with general nonnegative matrices
- Nonstationary Markov decision problems with converging parameters
- A value iteration method for undiscounted multichain Markov decision processes
- Contraction mappings underlying undiscounted Markov decision problems
This page was built for publication: Geometric convergence of value-iteration in multichain Markov decision problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4187616)
