15 citations · 37 across the 12 of their papers we have counts for
7 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…
Playing Safe, Ten Years Later
Thomas Colcombet, Nathanaël Fijalkow, Florian Horn
We consider two-player games over graphs and give tight bounds on the memory size of strategies ensuring safety objectives. More specifically, we show that the minimal number of me…
Entropy Games and Matrix Multiplication Games
Eugene Asarin, Julien Cervelle, Aldric Degorre +3
Two intimately related new classes of games are introduced and studied: entropy games (EGs) and matrix multiplication games (MMGs). An EG is played on a finite arena by two-and-a-h…
How do we remember the past in randomised strategies?
Julien Cristau, Claire David, Florian Horn
Graph games of infinite length are a natural model for open reactive processes: one player represents the controller, trying to ensure a given specification, and the other represen…
Random Fruits on the Zielonka Tree
Florian Horn
Stochastic games are a natural model for the synthesis of controllers confronted to adversarial and/or random actions. In particular, -regular games of infinite length can repre…
Optimal Strategies in Perfect-Information Stochastic Games with Tail Winning Conditions
Hugo Gimbert, Florian Horn
We prove that optimal strategies exist in every perfect-information stochastic game with finitely many states and actions and a tail winning condition.