Bounds for synchronizing Markov decision processes

DOI10.1007/978-3-031-09574-0_9OpenAlexW4285183152MaRDI QIDQ2097220

Laurent Doyen, Marie van den Bogaard

Publication date: 11 November 2022

Full work available at URL: https://arxiv.org/abs/2204.12814

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A survey of stochastic \(\omega \)-regular games
• The complexity of synchronizing Markov decision processes
• Controlling a random population
• A note on emptiness for alternating finite automata with a one-letter alphabet
• Probabilistic Bisimulation: Naturally on Distributions
• The complexity of probabilistic verification
• Decidability of Cutpoint Isolation for Probabilistic Finite Automata on Letter-Bounded Inputs.
• Distribution-based objectives for Markov Decision Processes
• Probabilistic automata
• Handbook of Markov decision processes. Methods and applications

This page was built for publication: Bounds for synchronizing Markov decision processes