3 papers
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.LO2026
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…
cs.GT2025
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…