Robust Synchronization in Markov Decision Processes

DOI10.1007/978-3-662-44584-6_17zbMath1417.68140arXiv1402.2840OpenAlexW1525220072MaRDI QIDQ3190121

Laurent Doyen, Thierry Massart, Mahsa Shirmohammadi

Publication date: 15 September 2014

Published in: CONCUR 2014 – Concurrency Theory (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Applications of game theory (91A80) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (2)

Some results concerning careful synchronization of partial automata and subset synchronization of DFA's ⋮ Synchronizing automata with coinciding cycles

This page was built for publication: Robust Synchronization in Markov Decision Processes