Optimizing Minimax Regret in Uncertain MDPs with Small Sets of Policies
Sequential decision-making in real-world applications often involves uncertainty about the environment's model. Uncertain Markov decision processes (UMDPs) represent the possible environments as a set of MDPs with shared states and actions but potentially different transition probabilities and rewards. Optimizing a single policy across all possible MDPs may sacrifice performance, while preparing…
We haven't written up this one. arXiv cs.AI has the full story — the link below goes straight to it.
