Answers are grounded in this paper and cite their sources.
Given a family of Markov chains with a single recurrent class, we present a potential application of Schweitzer's exact formula relating the steady-state probability and fundamental matrices of any two chains in the family. We propose a new policy iteration scheme for Markov decision processes where in contrast to policy iteration, the new criterion for selecting an action ensures the maximal one-step average cost improvement. Its computational complexity and storage requirement are analysed.
No takes yet. Share an insight, caveat, or question.
Jean B. Lasserre (1994) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: