Now showing items 1-1 of 1
Simplex Algorithm for Countable-state Discounted Markov Decision Processes
(2014-11-18)
We consider discounted Markov Decision Processes (MDPs) with countably-infinite state spaces, finite action spaces, and unbounded rewards. Typical examples of such MDPs are inventory management and queueing control problems ...