Sciweavers

350 search results - page 1 / 70
» On Strategy Improvement Algorithms for Simple Stochastic Gam...
Sort
View
96
Voted
CIAC
2010
Springer
259views Algorithms» more  CIAC 2010»
15 years 1 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
CONCUR
2006
Springer
15 years 1 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
81
Voted
ISAAC
2009
Springer
169views Algorithms» more  ISAAC 2009»
15 years 4 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»
15 years 6 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
CIE
2008
Springer
14 years 11 months ago
A Simple P-Matrix Linear Complementarity Problem for Discounted Games
The values of a two-player zero-sum binary discounted game are characterized by a P-matrix linear complementarity problem (LCP). Simple formulas are given to describe the data of t...
Marcin Jurdzinski, Rahul Savani