The complexity of graph-based reductions for reachability in Markov decision processes
From MaRDI portal
Publication:1652999
DOI10.1007/978-3-319-89366-2_20zbMath1504.68144arXiv1710.07903OpenAlexW2963629611MaRDI QIDQ1652999
Guillermo A. Pérez, Stéphane Le Roux
Publication date: 17 July 2018
Full work available at URL: https://arxiv.org/abs/1710.07903
Markov and semi-Markov decision processes (90C40) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)
Related Items (1)
This page was built for publication: The complexity of graph-based reductions for reachability in Markov decision processes
