33 search results - page 4 / 7 » A Deterministic Subexponential Algorithm for Solving Parity ... |
79
Voted
CIE
2008
Springer
14 years 11 months ago
2008
Springer
We revisit the deterministic graphical games of Washburn. A deterministic graphical game can be described as a simple stochastic game (a notion due to Anne Condon), except that we ...
CONCUR
2008
Springer
14 years 11 months ago
2008
Springer
We consider imperfect-information parity games in which strategies rely on observations that provide imperfect information about the history of a play. To solve such games, i.e., t...
VALUETOOLS
2006
ACM
15 years 3 months ago
2006
ACM
Min-max functions are dynamic programming operators of zero-sum deterministic games with finite state and action spaces. The problem of computing the linear growth rate of the or...
FORMATS
2008
Springer
14 years 11 months ago
2008
Springer
We consider two-player games played in real time on game structures with clocks and parity objectives. The games are concurrent in that at each turn, both players independently pro...
81
Voted
ISAAC
2009
Springer
15 years 4 months ago
2009
Springer
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...