Policy iteration for discounted robust MDPs is strongly polynomial for L1 and L∞ uncertainty sets but hard for other Lp sets.
Principles of model checking , publisher =
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
years
2026 3roles
background 1polarities
background 1representative citing papers
Right-linear overlay TRSs terminate if and only if they are innermost terminating, because absence of infinite minimal dependency-pair chains is equivalent to absence of infinite innermost minimal dependency-pair chains.
citing papers explorer
-
On the Complexity of Discounted Robust MDPs with $L_p$ Uncertainty Sets
Policy iteration for discounted robust MDPs is strongly polynomial for L1 and L∞ uncertainty sets but hard for other Lp sets.
-
Termination of Innermost-Terminating Right-Linear Overlay Term Rewrite Systems (Full Version)
Right-linear overlay TRSs terminate if and only if they are innermost terminating, because absence of infinite minimal dependency-pair chains is equivalent to absence of infinite innermost minimal dependency-pair chains.
- Complete $\omega$-Regular Supermartingale Certificates