Showing cs.GTShow all
3 papers · 1 filter
cs.GT2026
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…
cs.GT2026
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…
cs.GT2024
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…