17 search results - page 2 / 4 » Perfect-Information Stochastic Parity Games |
ATVA
2009
Springer
15 years 4 months ago
2009
Springer
Parity games are 2-player games of perfect information and infinite duration that have important applications in automata theory and decision procedures (validity as well as model...
CSL
2003
Springer
15 years 2 months ago
2003
Springer
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...
FSTTCS
2008
Springer
14 years 10 months ago
2008
Springer
We present a polynomial-time reduction from parity games with imperfect information to safety games with imperfect information. Similar reductions for games with perfect informatio...
64
Voted
SODA
2004
ACM
14 years 11 months ago
2004
ACM
We study perfect-information stochastic parity games. These are two-player nonterminating games which are played on a graph with turn-based probabilistic transitions. A play resul...
ICALP
2005
Springer
15 years 3 months ago
2005
Springer
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...