Showing cs.GTShow all
3 papers · 1 filter
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.GT2024
Faster Game Solving by Fixpoint Acceleration
Daniel Hausmann
We propose a method for solving parity games with acyclic (DAG) sub-structures by computing nested fixpoints of a DAG attractor function that lives over the non-DAG parts of the ga…