18 citations · 38 across the 11 of their papers we have counts for
15 papers
Optimal strategies in concurrent reachability games
Benjamin Bordais, Patricia Bouyer, Stéphane Le Roux
We study two-player reachability games on finite graphs. At each state the interaction between the players is concurrent and there is a stochastic Nature. Players also play stochas…
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…
From local to global determinacy in concurrent graph games
Benjamin Bordais, Patricia Bouyer, Stéphane Le Roux
In general, finite concurrent two-player reachability games are only determined in a weak sense: the supremum probability to win can be approached via stochastic strategies, but ca…
Anti-unification of Unordered Goals
Gonzague Yernaux, Wim Vanhoof
Anti-unification in logic programming refers to the process of capturing common syntactic structure among given goals, computing a single new goal that is more general called a gen…
Games Where You Can Play Optimally with Arena-Independent Finite Memory
Patricia Bouyer, Stéphane Le Roux, Youssouf Oualhadj +2
For decades, two-player (antagonistic) games on graphs have been a framework of choice for many important problems in theoretical computer science. A notorious one is controller sy…
Time-aware uniformization of winning strategies
Stéphane Le Roux
Two-player win/lose games of infinite duration are involved in several disciplines including computer science and logic. If such a game has deterministic winning strategies, one ma…