Sciweavers

11 search results - page 1 / 3
» Perfect Information Stochastic Priority Games
Sort
View
ICALP
2007
Springer
13 years 11 months 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
CORR
2008
Springer
81views Education» more  CORR 2008»
13 years 5 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
IPCO
2010
125views Optimization» more  IPCO 2010»
13 years 6 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...
FOSSACS
2004
Springer
13 years 10 months 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
ICALP
2005
Springer
13 years 11 months ago
Recursive Markov Decision Processes and Recursive Stochastic Games
We introduce Recursive Markov Decision Processes (RMDPs) and Recursive Simple Stochastic Games (RSSGs), which are classes of (finitely presented) countable-state MDPs and zero-su...
Kousha Etessami, Mihalis Yannakakis