Sciweavers

17 search results - page 3 / 4
» Perfect-Information Stochastic Parity Games
Sort
View
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
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...
ISAAC
2009
Springer
169views Algorithms» more  ISAAC 2009»
14 years 3 months ago
The Complexity of Solving Stochastic Games on Graphs
We consider some well-known families of two-player zero-sum perfect-information stochastic games played on finite directed graphs. Generalizing and unifying results of Liggett and...
Daniel Andersson, Peter Bro Miltersen
ICGA
2006
83views Optimization» more  ICGA 2006»
13 years 8 months ago
A Tool for the Direct Assessment of Poker Decisions
The element of luck permeates every aspect of the game of poker. Random stochastic outcomes introduce a large amount of noise that can make it very difficult to distinguish a good...
Darse Billings, Morgan Kan
FSTTCS
2005
Springer
14 years 2 months ago
Semiperfect-Information Games
Much recent research has focused on the applications of games with ω-regular objectives in the control and verification of reactive systems. However, many of the game-based model...
Krishnendu Chatterjee, Thomas A. Henzinger