1599 search results - page 6 / 320 » Algorithms for Parity Games |
143
Voted
CAV
2009
Springer
15 years 10 months ago
2009
Springer
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...
129
Voted
CSL
2008
Springer
15 years 5 months ago
2008
Springer
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...
155
Voted
LICS
2005
IEEE
15 years 9 months ago
2005
IEEE
Games played on graphs may have qualitative objectives, such as the satisfaction of an ω-regular property, or quantitative objectives, such as the optimization of a realvalued re...
147
Voted
CSL
2002
Springer
15 years 3 months ago
2002
Springer
d Abstract) Marcin Jurdzi
121
Voted
LPAR
2010
Springer
15 years 2 months ago
2010
Springer
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...