4 papers
Characterizing normality via automata and random matrix products
Laurent Bienvenu, Santiago Cifuentes, Hugo Gimbert
For a fixed alphabet A, an infinite sequence X is said to be normal if every word w over A appears in X with the same frequency as any other word of the same length. A classical re…
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…
Optimal Sequential Flows
Hugo Gimbert, Corto Mascle, Patrick Totzke
We provide a new algebraic technique to solve the sequential flow problem in polynomial space. The task is to maximise the flow through a graph where edge capacities can be changed…
Simplifying imperfect recall games
Hugo Gimbert, Soumyajit Paul, B. Srivathsan
In games with imperfect recall, players may forget the sequence of decisions they made in the past. When players also forget whether they have already encountered their current dec…