Sciweavers

44 search results - page 3 / 9
» Simple Stochastic Parity Games
Sort
View
SODA
2010
ACM
160views Algorithms» more  SODA 2010»
14 years 2 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
CONCUR
2009
Springer
13 years 12 months ago
Winning Regions of Pushdown Parity Games: A Saturation Method
We present a new algorithm for computing the winning region of a parity game played over the configuration graph of a pushdown system. Our method gives the first extension of the...
Matthew Hague, C.-H. Luke Ong
ICALP
2005
Springer
13 years 10 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
ERSHOV
2006
Springer
13 years 9 months ago
Linear Complementarity and P-Matrices for Stochastic Games
Abstract. We define the first nontrivial polynomially recognizable subclass of P-matrix Generalized Linear Complementarity Problems (GLCPs) with a subexponential pivot rule. No suc...
Ola Svensson, Sergei G. Vorobyov
ICALP
2009
Springer
14 years 5 months ago
The Complexity of Nash Equilibria in Simple Stochastic Multiplayer Games
We analyse the computational complexity of finding Nash equilibria in simple stochastic multiplayer games. We show that restricting the search space to equilibria whose payoffs fal...
Michael Ummels, Dominik Wojtczak