5 citations · 5 across the 6 of their papers we have counts for
7 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…
Visibly Recursive Automata
Kévin Dubrulle, Véronique Bruyère, Guillermo A. Pérez +1
As an alternative to visibly pushdown automata, we introduce visibly recursive automata (VRAs), composed of a set of classical automata that can call each other. VRAs are a strict…
An Automata-Based Approach to Games with -Automatic Preferences
Véronique Bruyère, Emmanuel Filiot, Christophe Grandmont +1
This paper studies multiplayer turn-based games on graphs in which player preferences are modeled as -automatic relations given by deterministic parity automata. This contrasts…
Games with -Automatic Preference Relations
Véronique Bruyère, Christophe Grandmont, Jean-François Raskin
This paper investigates Nash equilibria (NEs) in multi-player turn-based games on graphs, where player preferences are modeled as -automatic relations via deterministic parity a…
The Non-Cooperative Rational Synthesis Problem for Subgame Perfect Equilibria and omega-regular Objectives
Véronique Bruyère, Jean-François Raskin, Alexis Reynouard +1
This paper studies the rational synthesis problem for multi-player games played on graphs when rational players are following subgame perfect equilibria. In these games, one player…
Active Learning of Mealy Machines with Timers
Véronique Bruyère, Bharat Garhewal, Guillermo A. Pérez +2
We present the first algorithm for query learning Mealy machines with timers in a black-box context. Our algorithm is an extension of the L# algorithm of Vaandrager et al. to a tim…
As Soon as Possible but Rationally
Véronique Bruyère, Christophe Grandmont, Jean-François Raskin
This paper addresses complexity problems in rational verification and synthesis for multi-player games played on weighted graphs, where the objective of each player is to minimize…