Trading Performance for Stability in Markov Decision Processes

DOI10.1109/LICS.2013.39zbMath1366.68087OpenAlexW2030372341MaRDI QIDQ5271070

Tomáš Brázdil, Vojtěch Forejt, Krishnendu Chatterjee, Antonín Kučera

Publication date: 3 July 2017

Published in: 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/lics.2013.39

zbMATH Keywords

Markov decision processesmean payoff

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Synthesis problems (93B50) Markov and semi-Markov decision processes (90C40) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (4)

Graph Games and Reactive Synthesis ⋮ Efficient and Dynamic Algorithms for Alternating Büchi Games and Maximal End-Component Decomposition ⋮ Trading performance for stability in Markov decision processes ⋮ Meet your expectations with guarantees: beyond worst-case synthesis in quantitative games

This page was built for publication: Trading Performance for Stability in Markov Decision Processes