"A Near-Optimal Poly-Time Algorithm for Learning a class of Stochastic Games."

Ronen I. Brafman, Moshe Tennenholtz (1999)

> Home

Details and statistics

DOI: —

access: open

type: Conference or Workshop Paper

metadata version: 2019-08-20

- view
  - electronic edition @ ijcai.org (open access)
- export record
  dblp key:
  - conf/ijcai/BrafmanT99
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ijcai/BrafmanT99
Ronen I. Brafman, Moshe Tennenholtz:
A Near-Optimal Poly-Time Algorithm for Learning a class of Stochastic Games. IJCAI 1999: 734-739

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.