Carregant...
Good-for-MDPs Automata for Probabilistic Analysis and Reinforcement Learning
We characterize the class of nondeterministic [Formula: see text]-automata that can be used for the analysis of finite Markov decision processes (MDPs). We call these automata ‘good-for-MDPs’ (GFM). We show that GFM automata are closed under classic simulation as well as under more powerful simulati...
Guardat en:
| Publicat a: | Tools and Algorithms for the Construction and Analysis of Systems |
|---|---|
| Autors principals: | , , , , , |
| Format: | Artigo |
| Idioma: | Inglês |
| Publicat: |
2020
|
| Matèries: | |
| Accés en línia: | https://ncbi.nlm.nih.gov/pmc/articles/PMC7439745/ https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1007/978-3-030-45190-5_17 |
| Etiquetes: |
Afegir etiqueta
Sense etiquetes, Sigues el primer a etiquetar aquest registre!
|