In this paper, we consider algorithms to decide the existence of strategies in MDPs for Boolean combinations of objectives. These objectives are omega-regular properties that need to be enforced either surely, almost surely, existentially, or with non-zero probability. In this setting, relevant strategies are randomized infinite memory strategies: both infinite memory and randomization may be needed to play optimally. We provide algorithms to solve the general case of Boolean combinations and we also investigate relevant subcases. We further report on complexity bounds for these problems.
@article{arxiv.2004.13789,
title = {Mixing Probabilistic and non-Probabilistic Objectives in Markov Decision Processes},
author = {Raphaël Berthon and Shibashis Guha and Jean-François Raskin},
journal= {arXiv preprint arXiv:2004.13789},
year = {2020}
}