The simplex method is strongly polynomial for deterministic Markov decision processes
Year of publication: |
2015
|
---|---|
Authors: | Post, Ian ; Ye, Yinyu |
Published in: |
Mathematics of operations research. - Catonsville, MD : INFORMS, ISSN 0364-765X, ZDB-ID 195683-8. - Vol. 40.2015, 4, p. 859-868
|
Subject: | Markov decision process | simplex method | linear programming | strongly polynomial | Markov-Kette | Markov chain | Theorie | Theory | Mathematische Optimierung | Mathematical programming |
-
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
Feinberg, Eugene A., (2014)
-
Wang, Mengdi, (2020)
- More ...
-
Liquidity in Credit Networks: A Little Trust Goes a Long Way
Dandekar, Pranav, (2010)
-
Variance reduced value iteration and faster algorithms for solving Markov decision processes
Wu, Xian, (2021)
-
A Centered Projective Algorithm for Linear Programming
Todd, Michael J., (1988)
- More ...