ML Anthology

A Near-Optimal Poly-Time Algorithm for Learning a Class of Stochastic Games

Ronen I. Brafman, Moshe Tennenholtz
IJCAI 1999 pp. 734-739
/ijcai/1999/brafman1999ijcai-near/
PDF IJCAI Semantic Scholar

Cite

Text

Brafman and Tennenholtz. "A Near-Optimal Poly-Time Algorithm for Learning a Class of Stochastic Games." International Joint Conference on Artificial Intelligence, 1999.

Markdown

[Brafman and Tennenholtz. "A Near-Optimal Poly-Time Algorithm for Learning a Class of Stochastic Games." International Joint Conference on Artificial Intelligence, 1999.](https://mlanthology.org/ijcai/1999/brafman1999ijcai-near/)

BibTeX

@inproceedings{brafman1999ijcai-near,
  title     = {{A Near-Optimal Poly-Time Algorithm for Learning a Class of Stochastic Games}},
  author    = {Brafman, Ronen I. and Tennenholtz, Moshe},
  booktitle = {International Joint Conference on Artificial Intelligence},
  year      = {1999},
  pages     = {734-739},
  url       = {https://mlanthology.org/ijcai/1999/brafman1999ijcai-near/}
}