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;]

---

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 put each process in a local accepting state.

---