"A near-optimal polynomial time algorithm for learning in certain classes ..."

Ronen I. Brafman, Moshe Tennenholtz (2000)

> Home

Details and statistics

DOI: 10.1016/S0004-3702(00)00039-4

access: closed

type: Journal Article

metadata version: 2019-10-19

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/ai/BrafmanT00
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ai/BrafmanT00
Ronen I. Brafman, Moshe Tennenholtz:
A near-optimal polynomial time algorithm for learning in certain classes of stochastic games. Artif. Intell. 121(1-2): 31-47 (2000)

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.