Constrained MDPs with recursively computable cost criteria admit polynomial-time (0, epsilon)-bicriteria approximations.
Title resolution pending
1 Pith paper cite this work, alongside 3 external citations. Polarity classification is still indexing.
1
Pith paper citing it
3
external citations · OpenAlex
citation-role summary
background 1
citation-polarity summary
fields
cs.DS 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
Polynomial-Time Approximability of Constrained Reinforcement Learning
Constrained MDPs with recursively computable cost criteria admit polynomial-time (0, epsilon)-bicriteria approximations.