Abstract
Markov decision processes (MDPs) are a standard model for dynamic systems that exhibit both stochastic and nondeterministic behavior. For MDPs with finite state space it is known that for a wide range of objectives there exist optimal strategies that are memoryless and deterministic. In contrast, if the state space is infinite, optimal strategies may not exist, and optimal or ε-optimal strategies may require (possibly infinite) memory. In this paper we consider qualitative objectives: reachability, safety, (co-)Büchi, and other parity objectives. We aim at giving an introduction to a collection of techniques that allow for the construction of strategies with little or no memory in countably infinite MDPs.
Original language | English |
---|---|
Title of host publication | 47th International Colloquium on Automata, Languages, and Programming (ICALP 2020) |
Editors | Artur Czumaj, Anuj Dawar, Emanuela Merelli |
Publisher | Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany |
Pages | 1-18 |
Number of pages | 18 |
ISBN (Print) | 978-3-95977-138-2 |
DOIs | |
Publication status | Published - 29 Jun 2020 |
Event | 47th International Colloquium on Automata, Languages and Programming - Virtual conference, Germany Duration: 8 Jul 2020 → 11 Jul 2020 https://icalp2020.saarland-informatics-campus.de/ |
Publication series
Name | Leibniz International Proceedings in Informatics (LIPIcs) |
---|---|
Publisher | Schloss Dagstuhl--Leibniz-Zentrum für Informatik |
Volume | 168 |
ISSN (Electronic) | 1868-8969 |
Conference
Conference | 47th International Colloquium on Automata, Languages and Programming |
---|---|
Abbreviated title | ICALP 2020 |
Country/Territory | Germany |
City | Virtual conference |
Period | 8/07/20 → 11/07/20 |
Internet address |
Keywords
- Markov decision processes