1 citations · 1 across the 2 of their papers we have counts for
4 papers
Randomise Alone, Reach as a Team
Léonard Brice, Thomas A. Henzinger, Alipasha Montaseri +2
We study concurrent graph games where n players cooperate against an opponent to reach a set of target states. Unlike traditional settings, we study distributed randomisation: team…
On the Complexity of Discounted Robust MDPs with Uncertainty Sets
Ali Asadi, Krishnendu Chatterjee, Alipasha Montaseri +1
A basic model in sequential decision making is the Markov decision process (MDP), which is extended to Robust MDPs (RMDPs) by allowing uncertainty in transition probabilities and o…
Limit-sure reachability for small memory policies in POMDPs is NP-complete
Ali Asadi, Krishnendu Chatterjee, Raimundo Saona +1
A standard model that arises in several applications in sequential decision making is partially observable Markov decision processes (POMDPs) where a decision-making agent interact…
Qualitative Analysis of -Regular Objectives on Robust MDPs
Ali Asadi, Krishnendu Chatterjee, Ehsan Kafshdar Goharshady +2
Robust Markov Decision Processes (RMDPs) generalize classical MDPs that consider uncertainties in transition probabilities by defining a set of possible transition functions. An ob…