R-MAX - A general polynomial time algorithm for near-optimal reinforcement learning

Ronen I. Brafman, Moshe Tennenholtz

Research output: Contribution to journalConference articlepeer-review

48 Scopus citations

Fingerprint

Dive into the research topics of 'R-MAX - A general polynomial time algorithm for near-optimal reinforcement learning'. Together they form a unique fingerprint.

Keyphrases

Computer Science