R-MAX - A General Polynomial Time Algorithm for Near-Optimal Reinforcement Learning

R-MAX - A General Polynomial Time Algorithm for Near-Optimal Reinforcement Learning.pdf	101.23kB

Type: Paper

Tags:

Metadata:

@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}}

Citation:

Brafman, R. I. & Tennenholtz, M.. (2014). R-MAX - A General Polynomial Time Algorithm for Near-Optimal Reinforcement Learning [Data set]. Academic Torrents. https://academictorrents.com/details/3699dda91f82f2c6083f50166e3675779762ee93

R-MAX - A General Polynomial Time Algorithm for Near-Optimal Reinforcement Learning Ronen I. Brafman and Moshe Tennenholtz

R-MAX - A General Polynomial Time Algorithm for Near-Optimal Reinforcement Learning
Ronen I. Brafman and Moshe Tennenholtz