Search Results for author:
Found 4 papers, 0 papers with code
Natural Strategic Ability in Stochastic Multi-Agent Systems
We also give a 2NEXPTIME complexity result for NatPATL* with the same restriction.
Active Learning of Sequential Transducers with Side Information about the Domain
We show that there exists an algorithm using string equation solvers that uses this knowledge to learn subsequential string transducers with a better guarantee on the required number of equivalence queries than classical active learning.
Mixing Probabilistic and non-Probabilistic Objectives in Markov Decision Processes
In this paper, we consider algorithms to decide the existence of strategies in MDPs for Boolean combinations of objectives.
Threshold Constraints with Guarantees for Parity Objectives in Markov Decision Processes
We establish that, for all variants of this problem, deciding the existence of a strategy lies in ${\sf NP} \cap {\sf coNP}$, the same complexity class as classical parity games.
