1 citations · 1 across the 3 of their papers we have counts for
6 papers
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…
Rational verification and checking for Nash and subgame-perfect equilibria in graph games
Léonard Brice, Jean-François Raskin, Marie van den Bogaard
We study two natural problems about rational behaviors in multiplayer non-zero-sum sequential infinite duration games played on graphs: checking problems, that consist in deciding…
Subgame-perfect Equilibria in Mean-payoff Games (journal version)
Léonard Brice, Marie van den Bogaard, Jean-François Raskin
In this paper, we provide an effective characterization of all the subgame-perfect equilibria in infinite duration games played on finite graphs with mean-payoff objectives. To thi…
On the Complexity of SPEs in Parity Games
Léonard Brice, Marie van den Bogaard, Jean-François Raskin
We study the complexity of problems related to subgame-perfect equilibria (SPEs) in infinite duration non zero-sum multiplayer games played on finite graphs with parity objectives.…
Subgame-perfect Equilibria in Mean-payoff Games
Léonard Brice, Jean-François Raskin, Marie Van Den Bogaard
In this paper, we provide an effective characterization of all the subgame-perfect equilibria in infinite duration games played on finite graphs with mean-payoff objectives. To thi…
The Complexity of Subgame Perfect Equilibria in Quantitative Reachability Games
Thomas Brihaye, Véronique Bruyère, Aline Goeminne +2
We study multiplayer quantitative reachability games played on a finite directed graph, where the objective of each player is to reach his target set of vertices as quickly as poss…