1599 search results - page 10 / 320 » Algorithms for Parity Games |
CORR
2010
Springer
14 years 9 months ago
2010
Springer
67
Voted
ENTCS
2002
14 years 9 months ago
2002
ICALP
2007
Springer
15 years 3 months ago
2007
Springer
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...
CAV
2006
Springer
15 years 1 months ago
2006
Springer
In automated synthesis, we transform a specification into a system that is guaranteed to satisfy the specification. In spite of the rich theory developed for system synthesis, litt...
CORR
2007
Springer
14 years 9 months ago
2007
Springer
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)