A new polynomial-time algorithm for linear programming
Combinatorica
Fibonacci heaps and their uses in improved network optimization algorithms
Journal of the ACM (JACM)
The complexity of Markov decision processes
Mathematics of Operations Research
Cyclic games and an algorithm to find minimax cycle means in directed graphs
USSR Computational Mathematics and Mathematical Physics
High probability parallel transitive-closure algorithms
SIAM Journal on Computing
The complexity of stochastic games
Information and Computation
Simple and Fast Algorithms for Linear and Integer Programs with Two Variables Per Inequality
SIAM Journal on Computing
Improved Algorithms for Linear Inequalities with Two Variables per Inequality
SIAM Journal on Computing
A subexponential randomized algorithm for the simple stochastic game problem
Information and Computation
The complexity of mean payoff games on graphs
Theoretical Computer Science
Complexity and real computation
Complexity and real computation
Introduction to algorithms
Dynamic Programming and Optimal Control, Two Volume Set
Dynamic Programming and Optimal Control, Two Volume Set
All pairs shortest paths using bridging sets and rectangular matrix multiplication
Journal of the ACM (JACM)
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Finite State Markovian Decision Processes
Finite State Markovian Decision Processes
Policy Invariance Under Reward Transformations: Theory and Application to Reward Shaping
ICML '99 Proceedings of the Sixteenth International Conference on Machine Learning
On policy iteration as a Newton's method and polynomial policy iteration algorithms
Eighteenth national conference on Artificial intelligence
Dynamic Programming
Algorithms for sequential decision-making
Algorithms for sequential decision-making
Complexity results for infinite-horizon markov decision processes
Complexity results for infinite-horizon markov decision processes
Experimental analysis of the fastest optimum cycle ratio and mean algorithms
ACM Transactions on Design Automation of Electronic Systems (TODAES)
Combinatorial structure and randomized subexponential algorithms for infinite games
Theoretical Computer Science
A New Complexity Result on Solving the Markov Decision Problem
Mathematics of Operations Research
On the complexity of policy iteration
UAI'99 Proceedings of the Fifteenth conference on Uncertainty in artificial intelligence
Polynomial value iteration algorithms for deterministic MDPs
UAI'02 Proceedings of the Eighteenth conference on Uncertainty in artificial intelligence
On the complexity of solving Markov decision problems
UAI'95 Proceedings of the Eleventh conference on Uncertainty in artificial intelligence
A subexponential lower bound for the random facet algorithm for parity games
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
| Hi-index | 0.00 |
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].