par Chatterjee, Krishnendu;Doyen, Laurent 
;Henzinger, Thomas A.
Référence Lecture notes in computer science, 5556 LNCS, PART 2, page (1-15)
Publication Publié, 2009
;Henzinger, Thomas A.Référence Lecture notes in computer science, 5556 LNCS, PART 2, page (1-15)
Publication Publié, 2009
Article révisé par les pairs
| Résumé : | A stochastic game is a two-player game played on a graph, where in each state the successor is chosen either by one of the players, or according to a probability distribution. We survey stochastic games with limsup and liminf objectives. A real-valued reward is assigned to each state, and the value of an infinite path is the limsup (resp. liminf) of all rewards along the path. The value of a stochastic game is the maximal expected value of an infinite path that can be achieved by resolving the decisions of the first player. We present the complexity of computing values of stochastic games and their subclasses, and the complexity of optimal strategies in such games. © 2009 Springer Berlin Heidelberg. |
