2008.04.17 |
| Date | Tue Apr 22 |
| Time | 14:15 — 15:15 |
| Location | DI-Turing-014 |
Title: Solving Simple Stochastic Games
Speaker: Hugo Gimbert, LABRI, CNRS, Bordeaux, France
Time: Tue Apr 22nd 2008, 14:15-15:15
Location: Turing-014
Abstract:
A Simple Stochastic Game is played by two players called Min and Max, moving turn by turn a pebble along edgesof a graph. Some vertices are random and the next vertex is chosen randomly with fixed transition probabilities. Player Max wants the pebble to reach a special vertex called the target vertex.
Solving a simple stochastic game consists in computing the maximal probability with which player Max can enforce the pebble to reach the target vertex.
Inthis talk, we will review known algorithm for solving simple stochastic games and we will present a new algorithm especially efficient for games with few random vertices.