49 citations · 140 across the 23 of their papers we have counts for
12 papers · 1 filter
Distributed Asynchronous Games With Causal Memory are Undecidable
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 p…
Constrained School Choice with Incomplete Information
Hugo Gimbert, Claire Mathieu, Simon Mauras
School choice is the two-sided matching market where students (on one side) are to be matched with schools (on the other side) based on their mutual preferences. The classical algo…
A Bridge between Polynomial Optimization and Games with Imperfect Recall
Hugo Gimbert, Soumyajit Paul, B. Srivathsan
We provide several positive and negative complexity results for solving games with imperfect recall. Using a one-to-one correspondence between these games on one side and multivari…
Pure and Stationary Optimal Strategies in Perfect-Information Stochastic Games with Global Preferences
Hugo Gimbert, Wieslaw Zielonka
We examine the problem of the existence of optimal deterministic stationary strategiesintwo-players antagonistic (zero-sum) perfect information stochastic games with finitely many…
Deciding Maxmin Reachability in Half-Blind Stochastic Games
Edon Kelmendi, Hugo Gimbert
Two-player, turn-based, stochastic games with reachability conditions are considered, where the maximizer has no information (he is blind) and is restricted to deterministic strate…
Submixing and Shift-invariant Stochastic Games
Hugo Gimbert, Edon Kelmendi
We consider zero-sum stochastic games with perfect information and finitely many states and actions. The payoff is computed by a function which associates to each infinite sequence…