research
∙
08/18/2023
Quantitative Reachability Stackelberg-Pareto Synthesis is NEXPTIME-Complete
In this paper, we deepen the study of two-player Stackelberg games playe...
share
research
∙
06/01/2022
The Reactive Synthesis Competition (SYNTCOMP): 2018-2021
We report on the last four editions of the reactive synthesis competitio...
research
∙
03/02/2022
Stackelberg-Pareto Synthesis (Extended Version)
We study the framework of two-player Stackelberg games played on graphs ...
research
∙
02/27/2022
Pareto-Rational Verification
We study the rational verification problem which consists in verifying t...
research
∙
02/17/2021
Stackelberg-Pareto Synthesis (Full Version)
In this paper, we study the framework of two-player Stackelberg games pl...
research
∙
07/16/2019
Partial Solvers for Generalized Parity Games
Parity games have been broadly studied in recent years for their applica...
research
∙
07/11/2019
On Relevant Equilibria in Reachability Games
We study multiplayer reachability games played on a finite directed grap...
research
∙
07/02/2019
Energy mean-payoff games
In this paper, we study one-player and two-player energy mean-payoff gam...
research
∙
05/02/2019
The Complexity of Subgame Perfect Equilibria in Quantitative Reachability Games (full version)
We study multiplayer quantitative reachability games played on a finite ...
research
∙
09/10/2018
Constrained Existence Problem for Weak Subgame Perfect Equilibria with ω-Regular Boolean Objectives
We study multiplayer turn-based games played on a finite directed graph ...
research
∙
06/14/2018
Constrained existence problem for weak subgame perfect equilibria with omega-regular Boolean objectives (full version)
We study multiplayer turn-based games played on a finite directed graph ...
research
∙
06/14/2018
Constrained existence problem for weak subgame perfect equilibria with omega-regular Boolean objectives
We study multiplayer turn-based games played on a finite directed graph ...
research
∙
07/19/2017