complexity theory 1graph games 1optimization 1parameterized complexity 1reachability games 1strategy memory 1
From the 1 of 3 linked papers with an AI index.
3 papers
cs.GT2026
Generalised Reachability Games
Sougata Bose, Nathanael Fijalkow, Daniel Hausmann +4
The paper investigates two-player turn-based games on graphs where a player must visit multiple target sets (generalised reachability), analyzing the computational complexity, para…
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.GT2025
Temporal Explorability Games
Pete Austin, Nicolas Mazzocchi, Sougata Bose +1
Temporal graphs extend ordinary graphs with discrete time that affects the availability of edges. We consider solving games played on temporal graphs where one player aims to explo…