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…
Pessimism of the Will, Optimism of the Intellect: Fair Protocols with Malicious but Rational Agents
Léonard Brice, Jean-François Raskin, Mathieu Sassolas +2
Fairness is a desirable and crucial property of many protocols that handle, for instance, exchanges of message. It states that if at least one agent engaging in the protocol is hon…
Expected Window Mean-Payoff
Benjamin Bordais, Shibashis Guha, Jean-François Raskin
In the window mean-payoff objective, given an infinite path, instead of considering a long run average, we consider the minimum payoff that can be ensured at every position of the…
Parameterized complexity of games with monotonically ordered ω-regular objectives
Véronique Bruyère, Quentin Hautem, Jean-François Raskin
In recent years, two-player zero-sum games with multiple objectives have received a lot of interest as a model for the synthesis of complex reactive systems. In this framework, Pla…