A Sparse Sampling Algorithm for Near-Optimal Planning in Large Markov Decision Processes

Cite

Text

Kearns et al. "A Sparse Sampling Algorithm for Near-Optimal Planning in Large Markov Decision Processes." International Joint Conference on Artificial Intelligence, 1999. doi:10.1023/A:1017932429737

Markdown

[Kearns et al. "A Sparse Sampling Algorithm for Near-Optimal Planning in Large Markov Decision Processes." International Joint Conference on Artificial Intelligence, 1999.](https://mlanthology.org/ijcai/1999/kearns1999ijcai-sparse/) doi:10.1023/A:1017932429737

BibTeX

@inproceedings{kearns1999ijcai-sparse,
  title     = {{A Sparse Sampling Algorithm for Near-Optimal Planning in Large Markov Decision Processes}},
  author    = {Kearns, Michael J. and Mansour, Yishay and Ng, Andrew Y.},
  booktitle = {International Joint Conference on Artificial Intelligence},
  year      = {1999},
  pages     = {1324-1231},
  doi       = {10.1023/A:1017932429737},
  url       = {https://mlanthology.org/ijcai/1999/kearns1999ijcai-sparse/}
}