3 papers
cs.GT2026
Generalised Reachability Games
Sougata Bose, Nathanael Fijalkow, Daniel Hausmann +4
We study two-player zero-sum turn-based games played on graphs with multiple reachability objectives called generalised reachability games. In classic reachability games the goal o…
cs.GT2025
Generalised Reachability Games Revisited
Sougata Bose, Daniel Hausmann, Soumyajit Paul +2
Classic reachability games on graphs are zero-sum games, where the goal of one player, Eve, is to visit a vertex from a given target set, and that of other player, Adam, is to prev…
cs.FL2022
On Good-for-MDPs Automata
Sven Schewe, Qiyi Tang, Tansholpan Zhanabekova
Nondeterministic good-for-MDPs (GFM) automata are for MDP model checking and reinforcement learning what good-for-games (GFG) automata are for reactive synthesis: a more compact al…