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

Ronen I. Brafman, Moshe Tennenholtz (2002)

> Home

Details and statistics

DOI: —

access: open

type: Journal Article

metadata version: 2024-09-11

- view
  - electronic edition @ jmlr.org (open access)
- export record
  dblp key:
  - journals/jmlr/BrafmanT02
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jmlr/BrafmanT02
Ronen I. Brafman, Moshe Tennenholtz:
R-MAX - A General Polynomial Time Algorithm for Near-Optimal Reinforcement Learning. J. Mach. Learn. Res. 3: 213-231 (2002)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.