13 citations · 20 across the 3 of their papers we have counts for
3 papers
Subgame Perfection in Graph Games with -Recognizable Preference Relations
Véronique Bruyère, Christophe Grandmont, Noémie Meunier +1
This paper investigates the constrained existence problem for subgame perfect equilibria (SPEs) in multiplayer graph games. In the proposed framework, each player has a preference…
Weak Subgame Perfect Equilibria and their Application to Quantitative Reachability
Thomas Brihaye, Véronique Bruyère, Noémie Meunier +1
We study -player turn-based games played on a finite directed graph. For each play, the players have to pay a cost that they want to minimize. Instead of the well-known notion o…
Secure Equilibria in Weighted Games
Véronique Bruyère, Noémie Meunier, Jean-François Raskin
We consider two-player non zero-sum infinite duration games played on weighted graphs. We extend the notion of secure equilibrium introduced by Chatterjee et al., from the Boolean…