//-->
The value iteration algorithm is not strongly polynomial for discounted dynamic programming
Feinberg, Eugene A., (2014)
Modified policy iteration algorithms are not strongly polynomial for discounted dynamic programming
Randomized linear programming solves the Markov decision problem in nearly linear (sometimes sublinear) time
Wang, Mengdi, (2020)
Karmarkar's algorithm and the ellipsoid method
Ye, Yinyu, (1987)
The simplex and policy-iteration methods are strongly polynomial for the Markov decision problem with a fixed discount rate
Ye, Yinyu, (2011)
Computational economy equilibrium and application
Ye, Yinyu, (2008)