We study how to efficiently combine formal methods, Monte Carlo Tree Sea...
We consider lexicographic bi-objective problems on Markov Decision Proce...
We study two natural problems about rational behaviors in multiplayer
no...
We study a variant of the problem of synthesizing Mealy machines that en...
We propose a framework for learning a fragment of probabilistic computat...
Given a Markov decision process (MDP) M and a formula Φ, the strategy
sy...
In this paper, we provide an effective characterization of all the
subga...
We study the framework of two-player Stackelberg games played on graphs ...
We study the rational verification problem which consists in verifying t...
We establish that the subgame perfect equilibrium (SPE) threshold proble...
We study the complexity of problems related to subgame-perfect equilibri...
Model checking has been developed for verifying the behaviour of systems...
Active learning is a setting in which a student queries a teacher, throu...
In this paper, we study the framework of two-player Stackelberg games pl...
In this paper, we provide an effective characterization of all the
subga...
There are situations in which an agent should receive rewards only after...
This volume contains the proceedings of the 11th International Symposium...
Two-player Stackelberg games are non-zero sum strategic games between a
...
In this paper, we consider the online computation of a strategy that aim...
In this paper, we investigate the combination of synthesis techniques an...
In this paper, we consider algorithms to decide the existence of strateg...
In this paper, we study the notion of adversarial Stackelberg value for
...
There are situations in which an agent should receive rewards only after...
This volume contains the proceedings of the Tenth International Symposiu...
Parity games have been broadly studied in recent years for their applica...
In this paper, we study one-player and two-player energy mean-payoff gam...
We study multiplayer quantitative reachability games played on a finite
...
We prove that the theory of monadic second order logic (MSO) of the infi...
In the window mean-payoff objective, given an infinite path, instead of
...
We study multiplayer turn-based games played on a finite directed graph ...
We study multiplayer turn-based games played on a finite directed graph ...
We study multiplayer turn-based games played on a finite directed graph ...
Admissible strategies, i.e. those that are not dominated by any other
st...
We formalize the problem of maximizing the mean-payoff value with high
p...
We report on the fourth reactive synthesis competition (SYNTCOMP 2017). ...
In recent years, two-player zero-sum games with multiple objectives have...
The beyond worst-case synthesis problem was introduced recently by Bruyè...
A standard objective in partially-observable Markov decision processes
(...