Sciweavers

71 search results - page 8 / 15
» Clique-Width and Parity Games
Sort
View
CORR
2010
Springer
42views Education» more  CORR 2010»
13 years 7 months ago
Local Strategy Improvement for Parity Game Solving
Oliver Friedmann, Martin Lange
CORR
2008
Springer
63views Education» more  CORR 2008»
13 years 7 months ago
Linear Time Algorithm for Weak Parity Games
Krishnendu Chatterjee
ENTCS
2002
58views more  ENTCS 2002»
13 years 6 months ago
From Parity Games to Circular Proofs
Luigi Santocanale
ICALP
2007
Springer
14 years 1 months ago
Perfect Information Stochastic Priority Games
We introduce stochastic priority games — a new class of perfect information stochastic games. These games can take two different, but equivalent, forms. In stopping priority ga...
Hugo Gimbert, Wieslaw Zielonka
CORR
2007
Springer
135views Education» more  CORR 2007»
13 years 7 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