1 citations · 1 across the 3 of their papers we have counts for
Showing 2021Show all
2 papers · 1 filter
cs.GT2021
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.…
cs.GT2021
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…