R-MAX - A General Polynomial Time Algorithm for Near-Optimal Reinforcement Learning. Brafman, R. I. and Tennenholtz, M. 3:213-231.
R-MAX - A General Polynomial Time Algorithm for Near-Optimal Reinforcement Learning [link]Paper  bibtex   
@article{brafmanRMAXGeneralPolynomial2002,
  title = {R-{{MAX}} - {{A General Polynomial Time Algorithm}} for {{Near}}-{{Optimal Reinforcement Learning}}},
  volume = {3},
  issn = {ISSN 1533-7928},
  url = {http://www.jmlr.org/papers/v3/brafman02a.html},
  issue = {Oct},
  journaltitle = {Journal of Machine Learning Research},
  urldate = {2019-01-21},
  date = {2002},
  pages = {213-231},
  author = {Brafman, Ronen I. and Tennenholtz, Moshe},
  file = {/home/dimitri/Nextcloud/Zotero/storage/JL529I5C/Brafman and Tennenholtz - 2002 - R-MAX - A General Polynomial Time Algorithm for Ne.pdf;/home/dimitri/Nextcloud/Zotero/storage/FVS2PYIW/brafman02a.html}
}
Downloads: 0