800 search results - page 44 / 160 » On the Complexity of Parity Games |
ISAAC
2004
Springer
14 years 2 months ago
2004
Springer
We propose a model of computation where a Turing machine is given random access to an advice string. With random access, an advice string of exponential length becomes meaningful ...
ATAL
2009
Springer
14 years 3 months ago
2009
Springer
Weighted voting games are a natural and practically important class of simple coalitional games, in which each agent is assigned a numeric weight, and a coalition is deemed to be ...
APLAS
2008
ACM
13 years 11 months ago
2008
ACM
Abstract. We study the problem of generating a test sequence that achieves maximal coverage for a reactive system under test. We formulate the problem as a repeated game between th...
ACMACE
2005
ACM
14 years 2 months ago
2005
ACM
Outdoor multi-player games are an increasingly popular application area for ubiquitous computing, supporting experimentation both with new technologies and new user experiences. T...
CORR
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. We consider approximating the minmax value of a multiplayer game in strategic form. Tightening recent bounds by Borgs et al., we observe that approximating the value with...