Welcome!
To use the personalized features of this site, please log in or register.
If you have forgotten your username or password, we can help.
My Menu
Saved Items

Perfect Information Stochastic Priority Games

Hugo GimbertContact Information and Wiesław ZielonkaContact Information

(1)  LIX, École Polytechnique, Palaiseau, France
(2)  LIAFA, Université Paris 7 and CNRS, Paris, France
Abstract
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 [1] and parity games [2] are special extreme cases of priority games.

Contact Information Hugo Gimbert
Email: gimbert@lix.polytechnique.fr

Contact Information Wiesław Zielonka
Email: zielonka@liafa.jussieu.fr
Fulltext Preview (Small, Large)
Image of the first page of the fulltext

References secured to subscribers.



Export this chapter
Export this chapter as RIS | Text
 
Referenced by
1 newer article

  1. Fischer, Diana (2009) Model Checking Games for the Quantitative μ-Calculus. Theory of Computing Systems
    [CrossRef]
Remote Address: 38.107.191.111 • Server: mpweb06
HTTP User Agent: CCBot/1.0 (+http://www.commoncrawl.org/bot.html)