Reductive MDPs: A Perspective Beyond Temporal Horizons

Thomas Spooner, Rui Silva, Joshua Lockhart +2

Solving general Markov decision processes (MDPs) is a computationally hard problem. Solving finite-horizon MDPs, on the other hand, is highly tractable with well known polynomial-t…