19 search results - page 1 / 4 » Quantitative stochastic parity games |
SODA
2004
ACM
13 years 6 months ago
2004
ACM
We study perfect-information stochastic parity games. These are two-player nonterminating games which are played on a graph with turn-based probabilistic transitions. A play resul...
IPL
2008
13 years 4 months ago
2008
Abstract. A stochastic graph game is played by two players on a game graph with probabilistic transitions. We consider stochastic graph games with -regular winning conditions speci...
CSL
2003
Springer
13 years 10 months ago
2003
Springer
Many verification, planning, and control problems can be modeled as games played on state-transition graphs by one or two players whose conflicting goals are to form a path in th...
ISAAC
2009
Springer
13 years 11 months ago
2009
Springer
We consider some well-known families of two-player zero-sum perfect-information stochastic games played on finite directed graphs. Generalizing and unifying results of Liggett and...
LICS
2005
IEEE
13 years 10 months ago
2005
IEEE
Games played on graphs may have qualitative objectives, such as the satisfaction of an ω-regular property, or quantitative objectives, such as the optimization of a realvalued re...