Sciweavers

32 search results - page 4 / 7
» Winning Cores in Parity Games
Sort
View
CORR
2006
Springer
103views Education» more  CORR 2006»
13 years 9 months ago
Positional Determinacy of Games with Infinitely Many Priorities
We study two-player games of infinite duration that are played on finite or infinite game graphs. A winning strategy for such a game is positional if it only depends on the current...
Erich Grädel, Igor Walukiewicz
MFCS
2009
Springer
14 years 4 months ago
Stochastic Games with Finitary Objectives
Abstract. The synthesis of a reactive system with respect to an ωregular specification requires the solution of a graph game. Such games have been extended in two natural ways. F...
Krishnendu Chatterjee, Thomas A. Henzinger, Floria...
FORMATS
2008
Springer
13 years 11 months ago
Timed Parity Games: Complexity and Robustness
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...
Krishnendu Chatterjee, Thomas A. Henzinger, Vinaya...
FSTTCS
2007
Springer
14 years 4 months ago
Solving Parity Games in Big Steps
Abstract. This paper proposes a new algorithm that improves the complexity bound for solving parity games. Our approach combines McNaughton’s iterated fixed point algorithm with...
Sven Schewe
CORR
2012
Springer
180views Education» more  CORR 2012»
12 years 5 months ago
Solving Cooperative Reliability Games
Cooperative games model the allocation of profit from joint actions, following considerations such as stability and fairness. We propose the reliability extension of such games, ...
Yoram Bachrach, Reshef Meir, Michal Feldman, Moshe...