Perfect Information Stochastic Priority Games

Hugo Gimbert (1) , Wieslaw Zielonka (2)

1 LaBRI - Laboratoire Bordelais de Recherche en Informatique
2 LIAFA - Laboratoire d'informatique Algorithmique : Fondements et Applications

We introduce stochastic priority games - a new class of perfect information stochastic games. These games can take two different, but equivalent, forms. In stopping priority games a play can be stopped by the environment after a finite number of stages, however, infinite plays are also possible. In discounted priority games only infinite plays are possible and the payoff is a linear combination of the classical discount payoff and of a limit payoff evaluating the performance at infinity. Shapley games and parity games are special extreme cases of priority games.

Domaines: Informatique et théorie des jeux [cs.GT]

Hugo Gimbert, Wieslaw Zielonka. Perfect Information Stochastic Priority Games. ICALP 07, Jul 2007, Wroclaw, Poland. pp.850-861, ⟨10.1007/978-3-540-73420-8_73⟩. ⟨hal-00140150⟩