Search

• < Previous
• 1
• Next >

---

Solving Simple Stochastic Games with Few Random Vertices

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&nbsp;[&hellip;]

---

Controlling a population

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&nbsp;[&hellip;]

---