ML Anthology

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

Ronen I. Brafman, Moshe Tennenholtz
IJCAI 2001 pp. 953-958
/ijcai/2001/brafman2001ijcai-r/
Semantic Scholar

Cite

Text

Brafman and Tennenholtz. "R-MAX - A General Polynomial Time Algorithm for Near-Optimal Reinforcement Learning." International Joint Conference on Artificial Intelligence, 2001.

Markdown

[Brafman and Tennenholtz. "R-MAX - A General Polynomial Time Algorithm for Near-Optimal Reinforcement Learning." International Joint Conference on Artificial Intelligence, 2001.](https://mlanthology.org/ijcai/2001/brafman2001ijcai-r/)

BibTeX

@inproceedings{brafman2001ijcai-r,
  title     = {{R-MAX - A General Polynomial Time Algorithm for Near-Optimal Reinforcement Learning}},
  author    = {Brafman, Ronen I. and Tennenholtz, Moshe},
  booktitle = {International Joint Conference on Artificial Intelligence},
  year      = {2001},
  pages     = {953-958},
  url       = {https://mlanthology.org/ijcai/2001/brafman2001ijcai-r/}
}