13 citations · 15 across the 5 of their papers we have counts for
10 papers
Stackelberg-Pareto Synthesis (Extended Version)
Véronique Bruyère, Baptiste Fievet, Jean-François Raskin +1
We study the framework of two-player Stackelberg games played on graphs in which Player 0 announces a strategy and Player 1 responds rationally with a strategy that is an optimal r…
Stackelberg-Pareto Synthesis (Full Version)
Véronique Bruyère, Jean-François Raskin, Clément Tamines
In this paper, we study the framework of two-player Stackelberg games played on graphs in which Player 0 announces a strategy and Player 1 responds rationally with a strategy that…
Partial Solvers for Generalized Parity Games
Véronique Bruyère, Guillermo A. Pérez, Jean-François Raskin +1
Parity games have been broadly studied in recent years for their applications to controller synthesis and verification. In practice, partial solvers for parity games that execute i…
On Relevant Equilibria in Reachability Games
Thomas Brihaye, Véronique Bruyère, Aline Goeminne +1
We study multiplayer reachability games played on a finite directed graph equipped with target sets, one for each player. In those reachability games, it is known that there always…
Energy mean-payoff games
Véronique Bruyère, Quentin Hautem, Mickael Randour +1
In this paper, we study one-player and two-player energy mean-payoff games. Energy mean-payoff games are games of infinite duration played on a finite graph with edges labeled by 2…
Constrained Existence Problem for Weak Subgame Perfect Equilibria with -Regular Boolean Objectives
Thomas Brihaye, Véronique Bruyère, Aline Goeminne +1
We study multiplayer turn-based games played on a finite directed graph such that each player aims at satisfying an omega-regular Boolean objective. Instead of the well-known notio…