Sciweavers

1503 search results - page 12 / 301
» Generalized Parity Games
Sort
View
ICALP
2007
Springer
14 years 3 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 9 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
AAAI
2007
13 years 11 months ago
Heuristic Evaluation Functions for General Game Playing
A general game playing program plays games that it has not previously encountered. A game manager program sends the game playing programs a description of a game’s rules and obj...
James Clune
MFCS
2009
Springer
14 years 3 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...
CAV
2009
Springer
168views Hardware» more  CAV 2009»
14 years 3 months ago
Games through Nested Fixpoints
In this paper we consider two-player zero-sum payoff games on finite graphs, both in the deterministic as well as in the stochastic setting. In the deterministic setting, we consi...
Thomas Gawlitza, Helmut Seidl