2 citations · 2 across the 1 of their papers we have counts for
Showing cs.GTShow all
3 papers · 1 filter
cs.GT2021
Finite-memory strategies in two-player infinite games
Patricia Bouyer, Stéphane Le Roux, Nathan Thomasset
We study infinite two-player win/lose games where are finite and . At each round Player 1 and Player 2 concurrently choose one action in…
cs.GT2019
On Relevant Equilibria in Reachability Games
Thomas Brihaye, Véronique Bruyère, Aline Goeminne +1
We study multiplayer reachability games played on a finite directed graph equipped with target sets, one for each player. In those reachability games, it is known that there always…
cs.GT2019★ 2 cited
Nash equilibria in games over graphs equipped with a communication mechanism
Patricia Bouyer, Nathan Thomasset
We study pure Nash equilibria in infinite-duration games on graphs, with partial visibility of actions but communication (based on a graph) among the players. We show that a simple…