R-MAX - A General Polynomial Time Algorithm for Near-Optimal Reinforcement Learning.pdf
101.23kB
Type: Paper Tags: Bibtex:
@article{3:9,author={Ronen I. Brafman and Moshe Tennenholtz}, Title={R-MAX - A General Polynomial Time Algorithm for Near-Optimal Reinforcement Learning},journal={Journal of Machine Learning Research},volume={3}, url={http://www.jmlr.org/papers/volume3/herbrich02a/errata.pdf}}
R-MAX - A General Polynomial Time Algorithm for Near-Optimal Reinforcement Learning.pdf