Sciweavers

Share
836 search results - page 2 / 168
» On the Complexity of Parity Games
Sort
View
FM
2008
Springer
148views Formal Methods» more  FM 2008»
8 years 5 months ago
Precise Interval Analysis vs. Parity Games
In [?], a practical algorithm for precise interval analysis is provided for which, however, no non-trivial upper complexity bound is known. Here, we present a lower bound by showin...
Thomas Gawlitza, Helmut Seidl
CSL
2007
Springer
8 years 10 months ago
Clique-Width and Parity Games
The question of the exact complexity of solving parity games is one of the major open problems in system verification, as it is equivalent to the problem of model-checking the mod...
Jan Obdrzálek
MFCS
2010
Springer
8 years 2 months ago
Parity Games with Partial Information Played on Graphs of Bounded Complexity
Abstract. We address the strategy problem for parity games with partial information and observable colors, played on finite graphs of bounded graph complexity. We consider several...
Bernd Puchala, Roman Rabinovich
CORR
2007
Springer
135views Education» more  CORR 2007»
8 years 4 months ago
Settling the Complexity of Computing Two-Player Nash Equilibria
We prove that Bimatrix, the problem of finding a Nash equilibrium in a two-player game, is complete for the complexity class PPAD (Polynomial Parity Argument, Directed version)
Xi Chen, Xiaotie Deng, Shang-Hua Teng
CAV
2007
Springer
157views Hardware» more  CAV 2007»
8 years 10 months ago
An Accelerated Algorithm for 3-Color Parity Games with an Application to Timed Games
Three-color parity games capture the disjunction of a B¨uchi and a co-B¨uchi condition. The most efficient known algorithm for these games is the progress measures algorithm by ...
Luca de Alfaro, Marco Faella
books