TY - JOUR
T1 - Discounted deterministic Markov decision processes and discounted all-pairs shortest paths
AU - Madani, Omid
AU - Thorup, Mikkel
AU - Zwick, Uri
PY - 2010/3/1
Y1 - 2010/3/1
N2 - We present algorithms for finding optimal strategies for discounted, infinite-horizon, Determinsitc Markov Decision Processes (DMDPs). Our fastest algorithm has a worst-case running time of O(mn), improving the recent bound of O(mn2) obtained by Andersson and Vorbyov [2006]. We also present a randomized O(m1/2n2)-time algorithm for finding Discounted All-Pairs Shortest Paths (DAPSP), improving an O(mn2)-time algorithm that can be obtained using ideas of Papadimitriou and Tsitsiklis [1987].
AB - We present algorithms for finding optimal strategies for discounted, infinite-horizon, Determinsitc Markov Decision Processes (DMDPs). Our fastest algorithm has a worst-case running time of O(mn), improving the recent bound of O(mn2) obtained by Andersson and Vorbyov [2006]. We also present a randomized O(m1/2n2)-time algorithm for finding Discounted All-Pairs Shortest Paths (DAPSP), improving an O(mn2)-time algorithm that can be obtained using ideas of Papadimitriou and Tsitsiklis [1987].
KW - Markov decision processes
KW - Minimum mean weight cycles
KW - Shortest paths
UR - http://www.scopus.com/inward/record.url?scp=77950836623&partnerID=8YFLogxK
U2 - 10.1145/1721837.1721849
DO - 10.1145/1721837.1721849
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:77950836623
SN - 1549-6325
VL - 6
JO - ACM Transactions on Algorithms
JF - ACM Transactions on Algorithms
IS - 2
M1 - 33
ER -