Sciweavers

163 search results - page 1 / 33
» Solving Simple Stochastic Games
Sort
View
ISAAC
2009
Springer
169views Algorithms» more  ISAAC 2009»
14 years 1 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
SODA
2010
ACM
160views Algorithms» more  SODA 2010»
14 years 4 months ago
Solving Simple Stochastic Tail Games
Stochastic games are a natural model for open reactive processes: one player represents the controller and his opponent represents a hostile environment. The evolution of the syste...
Hugo Gimbert, Florian Horn
CSL
2003
Springer
14 years 4 days 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...
CIE
2008
Springer
13 years 9 months ago
Solving Simple Stochastic Games
Hugo Gimbert, Florian Horn