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

{"_id":"zvCwRoyXLxTc2ptYf","bibbaseid":"brafman-tennenholtz-rmaxageneralpolynomialtimealgorithmfornearoptimalreinforcementlearning","authorIDs":[],"author_short":["Brafman, R. I.","Tennenholtz, M."],"bibdata":{"bibtype":"article","type":"article","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":[{"propositions":[],"lastnames":["Brafman"],"firstnames":["Ronen","I."],"suffixes":[]},{"propositions":[],"lastnames":["Tennenholtz"],"firstnames":["Moshe"],"suffixes":[]}],"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","bibtex":"@article{brafmanRMAXGeneralPolynomial2002,\n title = {R-{{MAX}} - {{A General Polynomial Time Algorithm}} for {{Near}}-{{Optimal Reinforcement Learning}}},\n volume = {3},\n issn = {ISSN 1533-7928},\n url = {http://www.jmlr.org/papers/v3/brafman02a.html},\n issue = {Oct},\n journaltitle = {Journal of Machine Learning Research},\n urldate = {2019-01-21},\n date = {2002},\n pages = {213-231},\n author = {Brafman, Ronen I. and Tennenholtz, Moshe},\n 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}\n}\n\n","author_short":["Brafman, R. I.","Tennenholtz, M."],"key":"brafmanRMAXGeneralPolynomial2002","id":"brafmanRMAXGeneralPolynomial2002","bibbaseid":"brafman-tennenholtz-rmaxageneralpolynomialtimealgorithmfornearoptimalreinforcementlearning","role":"author","urls":{"Paper":"http://www.jmlr.org/papers/v3/brafman02a.html"},"downloads":0},"bibtype":"article","biburl":"https://raw.githubusercontent.com/dlozeve/newblog/master/bib/all.bib","creationDate":"2020-01-08T20:39:39.232Z","downloads":0,"keywords":[],"search_terms":["max","general","polynomial","time","algorithm","near","optimal","reinforcement","learning","brafman","tennenholtz"],"title":"R-MAX - A General Polynomial Time Algorithm for Near-Optimal Reinforcement Learning","year":null,"dataSources":["3XqdvqRE7zuX4cm8m"]}