9 papers
Verification of Correlated Equilibria in Concurrent Reachability Games
Senthil Rajasekaran, Jean-François Raskin, Moshe Y. Vardi
As part of an effort to apply the rigorous guarantees of formal verification to multi-agent systems, the field of equilibrium analysis, also called rational verification, studies e…
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…
Synthesis from LTL with Reward Optimization in Sampled Oblivious Environments
Jean-François Raskin, Yun Chen Tsai
This paper addresses the synthesis of reactive systems that enforce hard constraints while optimizing for quality-based soft constraints. We build on recent advancements in combini…
Greybox Learning of Languages Recognizable by Event-Recording Automata
Anirban Majumdar, Sayan Mukherjee, Jean-François Raskin
In this paper, we revisit the active learning of timed languages recognizable by event-recording automata. Our framework employs a method known as greybox learning, which enables t…