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

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Asadi, Ali, Chatterjee, Krishnendu, Goharshady, Ehsan, Karrabi, Mehrdad, Montaseri, Alipasha, Pagano, Carlo
Format:	Preprint
Published:	2026
Subjects:	Artificial Intelligence Computational Complexity
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Internet

https://arxiv.org/abs/2601.23229