Hugo Gimbert
L'Abri
84 Papers
438 Citations
Hugo Gimbert is an academic researcher from L'Abri. The author has contributed to research in topics: Stochastic game & Decidability. The author has an hindex of 15, co-authored 80 publications. Previous affiliations of Hugo Gimbert include École Polytechnique & École Normale Supérieure.
Chat about Author
Papers
Games where you can play optimally without any memory
Hugo Gimbert,Wiesław Zielonka +1 more
- 23 Aug 2005
TL;DR: This paper presents a simple necessary and sufficient condition on payoff mapping guaranteeing the existence of optimal positional strategies for both players and shows the following remarkable property of payoff mappings: if both players have optimal positional Strategies when playing solitary one-player games then also they have optimal Positional strategies for two- player games.
Qualitative Determinacy and Decidability of Stochastic Games with Signals
Nathalie Bertrand,Blaise Genest,Hugo Gimbert +2 more
- 11 Aug 2009
TL;DR: It is proved that players only need strategies with finite-memory, whose sizes range from no memory at all to doubly-exponential number of states, with matching lower bounds, and together with the qualitative determinacy results, provide fix-point algorithms for deciding which player has an almost-surely winning or a positively winning strategy and for computing the finite memory strategy.
Randomness for Free
TL;DR: A complete characterization for the classes of games where randomness is not helpful in: the transition function (probabilistic transition can be simulated by deterministic transition); and (b) strategies (pure strategies are as powerful as randomized strategies).
62
Deciding the Value 1 Problem for Probabilistic Leaktight Automata
Nathanaël Fijalkow,Hugo Gimbert,Youssouf Oualhadj +2 more
- 25 Jun 2012
TL;DR: A new class of probabilistic automata is introduced, called leaktight automata, for which the value 1 problem is shown decidable (and PSPACE-complete), and an algorithm based on the computation of a monoid abstracting the behaviors of the automaton is constructed.
43
Asynchronous games over tree architectures
Blaise Genest,Hugo Gimbert,Anca Muscholl,Igor Walukiewicz +3 more
- 08 Jul 2013
TL;DR: The decidability of the control problem for Zielonka automata over acyclic communication architectures is shown, and a matching lower bound is provided, which is l-fold exponential, l being the height of the architecture tree.