1 citations · 1 across the 8 of their papers we have counts for
3 papers · 1 filter
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…
Simple Nash Equilibria for Qualitative Multiplayer Games
Mona Alluwaym, James C. A. Main, Sven Schewe
We investigate memory requirements for Nash and subgame-perfect equilibria in turn-based deterministic games with -regular objectives. We prove that memoryless randomised (i.e.,…
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.…