Distribution-based objectives for Markov Decision Processes
From MaRDI portal
Publication:5145274
DOI10.1145/3209108.3209185zbMath1497.68355arXiv1804.09341OpenAlexW2964314311MaRDI QIDQ5145274
S. Akshay, Blaise Genest, Nikhil Vyas
Publication date: 20 January 2021
Published in: Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1804.09341
Formal languages and automata (68Q45) Markov and semi-Markov decision processes (90C40) 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
Bounds for synchronizing Markov decision processes, On eventual non-negativity and positivity for the weighted sum of powers of matrices