Randomized Linear Programming Solves the Markov Decision Problem in Nearly Linear (Sometimes Sublinear) Time

Mengdi Wang. Randomized Linear Programming Solves the Markov Decision Problem in Nearly Linear (Sometimes Sublinear) Time. Math. Oper. Res., 45(2):517-546, 2020. [doi]

Abstract

Abstract is missing.