Perturbation Theory and Undiscounted Markov Renewal Programming
From MaRDI portal
Publication:5568938
DOI10.1287/opre.17.4.716zbMath0176.50003OpenAlexW1986211252MaRDI QIDQ5568938
Publication date: 1969
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.17.4.716
Related Items (11)
On the existence of relative values for undiscounted Markovian decision processes with a scalar gain rate ⋮ A methodology for computation reduction for specially structured large scale Markov decision problems ⋮ A Brouwer fixed-point mapping approach to communicating Markov decision processes ⋮ Generalized Markovian decision processes ⋮ Unnamed Item ⋮ On the existence of relative values for undiscounted multichain Markov decision processes ⋮ Bounds on the fixed point of a monotone contraction operator ⋮ Foolproof convergence in multichain policy iteration ⋮ Iterative solution of the functional equations of undiscounted Markov renewal programming ⋮ Estimating equilibrium probabilities for band diagonal Markov chains using aggregation and disaggregation techniques ⋮ The variational calculus and approximation in policy space for Markovian decision processes
This page was built for publication: Perturbation Theory and Undiscounted Markov Renewal Programming
