LABRI, Bordeaux
3pm Thursday, 4th March, 2010
Room 4.31/33, Informatics Forum
Algorithmics of stochastic games with partial observation is a challenging research field, where the undecidability frontier is easily crossed.
In this talk, we will survey classical and recent algorithmics and determinacy results about stochastic games with partial observation.
We will especially focus on the special case of probabilistic automata and present some new recent advances.