Strongly Polynomial Time Complexity of Policy Iteration for $L_\infty$ Robust MDPs 事件

Strongly Polynomial Time Complexity of Policy Iteration for $L_\infty$ Robust MDPs arXiv:2601.23229v2 Announce Type: replace Abstract: Markov decision processes (MDPs) are a fundamental model in sequential decision making. Robust MDPs (RMDPs) extend this framework by allowing uncertainty in transition probabilities and optimizing against the worst-case realization of that uncertainty. In particular, $(s, a)$-rectangular RMDPs with $L_\infty$ uncertainty sets form a fundamental and expressive mo