Markovian Decision Processes with Uncertain Transition Probabilities I: The Max-Min Policy-Iteration Algorithm Terminates at a Max-Min Optimal Pure Stationary PolicyResearch Paper
Howard's finite Markovian decision process (MDP) models a controller who, at each instant, observes the state of a system, chooses a decision, collects a reward and moves to a random next state with known transition probabilities. Howard's policy-iteration algorithm computes an optimal policy, and the model has been applied to inventory control, equipment…