We consider the problem of computing optimal policies of finite-state finite-action Markov decision processes (MDPs). A reduction to a continuum of constrained MDPs (CMDPs) is presented such that the ...

This is a preview. Log in through your library . Abstract The only known strongly polynomial algorithm for solving minimum cost submodular flow problems is due to Frank and Tardos [1985] and is based ...