Sciweavers

30 search results - page 1 / 6
» The Complexity of Partial-Observation Parity Games
Sort
View
LPAR
2010
Springer
13 years 5 months ago
The Complexity of Partial-Observation Parity Games
We consider two-player zero-sum games on graphs. On the basis of the information available to the players these games can be classified as follows: (a) partial-observation (both p...
Krishnendu Chatterjee, Laurent Doyen
MFCS
2010
Springer
13 years 5 months ago
Qualitative Analysis of Partially-Observable Markov Decision Processes
We study observation-based strategies for partially-observable Markov decision processes (POMDPs) with parity objectives. An observationbased strategy relies on partial information...
Krishnendu Chatterjee, Laurent Doyen, Thomas A. He...
ATAL
2004
Springer
14 years 26 days ago
Approximate Solutions for Partially Observable Stochastic Games with Common Payoffs
Partially observable decentralized decision making in robot teams is fundamentally different from decision making in fully observable problems. Team members cannot simply apply si...
Rosemary Emery-Montemerlo, Geoffrey J. Gordon, Jef...
BCS
2008
13 years 9 months ago
On the Complexity of Parity Games
Parity games underlie the model checking problem for the modal
Arnold Beckmann, Faron Moller
CSL
2008
Springer
13 years 9 months ago
The Descriptive Complexity of Parity Games
We study the logical definablity of the winning regions of parity games. For games with a bounded number of priorities, it is wellknown that the winning regions are definable in th...
Anuj Dawar, Erich Grädel