3 papers
cs.GT2026
The Complexity of Games with Randomised Control
Sarvin Bahmani, Rasmus Ibsen-Jensen, Soumyajit Paul +5
We study the complexity of solving two-player infinite duration games played on a fixed finite graph, where the control of a node is not predetermined but rather assigned randomly.…
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
Simplifying imperfect recall games
Hugo Gimbert, Soumyajit Paul, B. Srivathsan
In games with imperfect recall, players may forget the sequence of decisions they made in the past. When players also forget whether they have already encountered their current dec…