Using symbolic comparisons of rational value functions near gamma=1, the authors obtain the first strongly polynomial algorithms for Blackwell-optimal policies in deterministic MDPs and a subexponential expected algorithm for general MDPs.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.AI 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Efficient Computation of Blackwell Optimal Policies using Rational Functions
Using symbolic comparisons of rational value functions near gamma=1, the authors obtain the first strongly polynomial algorithms for Blackwell-optimal policies in deterministic MDPs and a subexponential expected algorithm for general MDPs.