3 results
Hugo Gimbert ; Florian Horn.
Simple stochastic games are two-player zero-sum stochastic games with turn-based moves, perfect information, and reachability winning conditions. We present two new algorithms computing the values of simple stochastic games. Both of them rely on the existence of optimal permutation strategies, a […]
Published on May 25, 2009
Nathalie Bertrand ; Miheer Dewaskar ; Blaise Genest ; Hugo Gimbert ; Adwait Amit Godbole.
We introduce a new setting where a population of agents, each modelled by a finite-state system, are controlled uniformly: the controller applies the same action to every agent. The framework is largely inspired by the control of a biological system, namely a population of yeasts, where the […]
Published on July 29, 2019
Hugo Gimbert.
We show the undecidability of the distributed control problem when the plant is an asynchronous automaton, the controllers use causal memory and the goal of the controllers is to put each process in a local accepting state.
Published on September 8, 2022