Sciweavers

44 search results - page 1 / 9
» Simple Stochastic Parity Games
Sort
View
CSL
2003
Springer
14 years 4 months ago
Simple Stochastic Parity Games
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...
Krishnendu Chatterjee, Marcin Jurdzinski, Thomas A...
IPL
2008
110views more  IPL 2008»
13 years 11 months ago
Reduction of stochastic parity to stochastic mean-payoff games
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...
Krishnendu Chatterjee, Thomas A. Henzinger
ISAAC
2009
Springer
169views Algorithms» more  ISAAC 2009»
14 years 5 months ago
The Complexity of Solving Stochastic Games on Graphs
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...
Daniel Andersson, Peter Bro Miltersen
ICALP
2010
Springer
14 years 2 months ago
Energy Parity Games
Energy parity games are infinite two-player turn-based games played on weighted graphs. The objective of the game combines a (qualitative) parity condition with the (quantitative)...
Krishnendu Chatterjee, Laurent Doyen
SODA
2004
ACM
94views Algorithms» more  SODA 2004»
14 years 8 days ago
Quantitative stochastic parity games
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...
Krishnendu Chatterjee, Marcin Jurdzinski, Thomas A...