We consider finite- and infinite-horizon Markov decision processes (MDPs) with unknown state-transition probabilities. They are assumed to belong to certain ambiguity sets, and the goal is to maxim…
We introduce a simplex method for general countably infinite linear programs. Previous literature has focused on special cases, such as infinite network flow problems or Markov decision processes. …