Related references
Note: Only part of the references are listed.Efficient Inverse Maintenance and Faster Algorithms for Linear Programming
Yin Tat Lee et al.
2015 IEEE 56TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (2015)
The value iteration algorithm is not strongly polynomial for discounted dynamic programming
Eugene A. Feinberg et al.
OPERATIONS RESEARCH LETTERS (2014)
Strategy Iteration Is Strongly Polynomial for 2-Player Turn-Based Stochastic Games with a Constant Discount Factor
Thomas Dueholm Hansen et al.
JOURNAL OF THE ACM (2013)
Minimax PAC bounds on the sample complexity of reinforcement learning with a generative model
Mohammad Gheshlaghi Azar et al.
MACHINE LEARNING (2013)
The Simplex and Policy-Iteration Methods Are Strongly Polynomial for the Markov Decision Problem with a Fixed Discount Rate
Yinyu Ye
MATHEMATICS OF OPERATIONS RESEARCH (2011)
A new complexity result on solving the Markov decision problem
YY Ye
MATHEMATICS OF OPERATIONS RESEARCH (2005)
A sparse sampling algorithm for near-optimal planning in large Markov decision processes
M Kearns et al.
MACHINE LEARNING (2002)
Share Paper
