@InProceedings{busattogaston_et_al:LIPIcs.CONCUR.2020.40,
author = {Busatto-Gaston, Damien and Chakraborty, Debraj and Raskin, Jean-Francois},
title = {{Monte Carlo Tree Search Guided by Symbolic Advice for MDPs}},
booktitle = {31st International Conference on Concurrency Theory (CONCUR 2020)},
pages = {40:1--40:24},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-160-3},
ISSN = {1868-8969},
year = {2020},
volume = {171},
editor = {Konnov, Igor and Kov\'{a}cs, Laura},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2020.40},
URN = {urn:nbn:de:0030-drops-128523},
doi = {10.4230/LIPIcs.CONCUR.2020.40},
annote = {Keywords: Markov decision process, Monte Carlo tree search, symbolic advice, simulation}
}