Sciweavers

15 search results - page 1 / 3
» Strategy Improvement for Stochastic Rabin and Streett Games
Sort
View
CONCUR
2006
Springer
13 years 8 months ago
Strategy Improvement for Stochastic Rabin and Streett Games
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 specified as Ra...
Krishnendu Chatterjee, Thomas A. Henzinger
ICALP
2005
Springer
13 years 10 months ago
The Complexity of Stochastic Rabin and Streett Games'
Krishnendu Chatterjee, Luca de Alfaro, Thomas A. H...
CONCUR
2005
Springer
13 years 10 months ago
Games Where You Can Play Optimally Without Any Memory
Abstract. Reactive systems are often modelled as two person antagonistic games where one player represents the system while his adversary represents the environment. Undoubtedly, t...
Hugo Gimbert, Wieslaw Zielonka
MFCS
2009
Springer
13 years 11 months ago
Stochastic Games with Finitary Objectives
Abstract. The synthesis of a reactive system with respect to an ωregular specification requires the solution of a graph game. Such games have been extended in two natural ways. F...
Krishnendu Chatterjee, Thomas A. Henzinger, Floria...
CIAC
2010
Springer
259views Algorithms» more  CIAC 2010»
13 years 8 months ago
On Strategy Improvement Algorithms for Simple Stochastic Games
The study of simple stochastic games (SSGs) was initiated by Condon for analyzing the computational power of randomized space-bounded alternating Turing machines. The game is play...
Rahul Tripathi, Elena Valkanova, V. S. Anil Kumar