Sciweavers

17 search results - page 1 / 4
» Perfect-Information Stochastic Parity Games
Sort
View
ICALP
2007
Springer
14 years 28 days ago
Perfect Information Stochastic Priority Games
We introduce stochastic priority games — a new class of perfect information stochastic games. These games can take two different, but equivalent, forms. In stopping priority ga...
Hugo Gimbert, Wieslaw Zielonka
FOSSACS
2004
Springer
14 years 5 days ago
Perfect-Information Stochastic Parity Games
We show that in perfect-information stochastic parity games with a finite state space both players have optimal pure positional strategies. Contrary to the recent proofs of this f...
Wieslaw Zielonka
IPCO
2010
125views Optimization» more  IPCO 2010»
13 years 8 months ago
A Pumping Algorithm for Ergodic Stochastic Mean Payoff Games with Perfect Information
Abstract. We consider two-person zero-sum stochastic mean payoff games with perfect information, or BWR-games, given by a digraph G = (V = VB VW VR, E), with local rewards r : E R...
Endre Boros, Khaled M. Elbassioni, Vladimir Gurvic...
CORR
2008
Springer
81views Education» more  CORR 2008»
13 years 6 months ago
Optimal Strategies in Perfect-Information Stochastic Games with Tail Winning Conditions
We prove that optimal strategies exist in perfect-information stochastic games with finitely many states and actions and tail winning conditions.
Florian Horn, Hugo Gimbert
IPL
2008
110views more  IPL 2008»
13 years 6 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