52 citations · 269 across the 38 of their papers we have counts for
6 papers · 1 filter
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…
Characterizing Omega-Regularity through Finite-Memory Determinacy of Games on Infinite Graphs
Patricia Bouyer, Mickael Randour, Pierre Vandenhove
We consider zero-sum games on infinite graphs, with objectives specified as sets of infinite words over some alphabet of colors. A well-studied class of objectives is the one of $ω…
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…
Arena-Independent Finite-Memory Determinacy in Stochastic Games
Patricia Bouyer, Youssouf Oualhadj, Mickael Randour +1
We study stochastic zero-sum games on graphs, which are prevalent tools to model decision-making in presence of an antagonistic opponent in a random environment. In this setting, a…