20 citations · 41 across the 31 of their papers we have counts for
6 papers · 1 filter
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…
Optimally Controlling a Random Population
Hugo Gimbert, Corto Mascle, Patrick Totzke
The population control problem is a parameterised problem where a controller sends messages to a whole population of identical finite-state agents, aiming to eventually move them a…
The Power of Counting Steps in Quantitative Games
Sougata Bose, Rasmus Ibsen-Jensen, David Purser +2
We study deterministic games of infinite duration played on graphs and focus on the strategy complexity of quantitative objectives. Such games are known to admit optimal memoryless…
Bounded-Memory Strategies in Partial-Information Games
Sougata Bose, Rasmus Ibsen-Jensen, Patrick Totzke
We study the computational complexity of solving stochastic games with mean-payoff objectives. Instead of identifying special classes in which simple strategies are sufficient to p…
Strategy Complexity of Büchi and Transience Objectives in Concurrent Stochastic Games
Stefan Kiefer, Richard Mayr, Mahsa Shirmohammadi +1
We study 2-player stochastic games on countable graphs. Players Max and Min seek respectively to maximize and minimize the probability of satisfying the game objective. The Büchi o…
Memoryless Strategies in Stochastic Reachability Games
Stefan Kiefer, Richard Mayr, Mahsa Shirmohammadi +1
We study concurrent stochastic reachability games played on finite graphs. Two players, Max and Min, seek respectively to maximize and minimize the probability of reaching a set of…