An improved algorithm for solving communicating average reward Markov decision processes
- 1 December 1991
- journal article
- Published by Springer Nature in Annals of Operations Research
- Vol. 28 (1) , 229-242
- https://doi.org/10.1007/bf02055583
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Markov Decision ProcessesPublished by Wiley ,1994
- Multichain Markov Decision Processes with a Sample Path Constraint: A Decomposition ApproachMathematics of Operations Research, 1991
- Communicating MDPs: Equivalence and LP propertiesOperations Research Letters, 1988
- Computing Optimal Policies for Controlled Tandem Queueing SystemsOperations Research, 1987
- On the Convergence of Policy Iteration in Finite State Undiscounted Markov Decision Processes: The Unichain CaseMathematics of Operations Research, 1987
- Optimal decision procedures for finite Markov chains. Part II: Communicating systemsAdvances in Applied Probability, 1973
- Scientific Applications: An algorithm for identifying the ergodic subchains and transient states of a stochastic matrixCommunications of the ACM, 1968
- Denumerable State Markovian Decision Processes-Average Cost CriterionThe Annals of Mathematical Statistics, 1966
- Discrete Dynamic ProgrammingThe Annals of Mathematical Statistics, 1962