activity
20112024
most citedGames Where You Can Play Optimally with Arena-Independent Finite Memory

18 citations · 34 across the 12 of their papers we have counts for

collaborators
Showing cs.GTShow all

5 papers · 1 filter

cs.GT2024★ 1 cited

Controller Synthesis in Timed Büchi Automata: Robustness and Punctual Guards

Benoît Barbot, Damien Busatto-Gaston, Catalin Dima +1

We consider the synthesis problem on timed automata with Büchi objectives, where delay choices made by a controller are subjected to small perturbations. Usually, the controller ne…

cs.GT2021★ 6 cited

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…

cs.GT2020★ 18 cited

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…

cs.GT2018

Banach-Mazur Parity Games and Almost-sure Winning Strategies

Youssouf Oualhadj, Léo Tible, Daniele Varacca

Two-player stochastic games are games with two 2 players and a randomised entity called "nature". A natural question to ask in this framework is the existence of strategies that en…

cs.GT2016★ 1 cited

Rational Verification in Iterated Electric Boolean Games

Youssouf Oualhadj, Nicolas Troquard

Electric boolean games are compact representations of games where the players have qualitative objectives described by LTL formulae and have limited resources. We study the complex…