800 search results - page 22 / 160 » On the Complexity of Parity Games |
ERSHOV
2003
Springer
14 years 2 months ago
2003
Springer
We present several new algorithms as well as new lower and upper bounds for optimizing functions underlying infinite games pertinent to computer-aided verification.
MST
2011
13 years 4 months ago
2011
This paper is concerned with the complexity of computing winning strategies for poset games. While it is reasonably clear that such strategies can be computed in PSPACE, we give a ...
FPLAY
2008
13 years 11 months ago
2008
Tabletop games provide an intimate gaming experience where groups of friends can interact in a shared space using shared physical props. Digital tabletop games show great promise ...
SPIN
2010
Springer
13 years 8 months ago
2010
Springer
Pushdown systems provide a natural model of software with recursive procedure calls. We provide a tool implementing an algorithm for computing the winning regions of a pushdown par...
JACM
2007
13 years 9 months ago
2007
abstraction of imperfect information games ANDREW GILPIN and TUOMAS SANDHOLM Computer Science Department Carnegie Mellon University Pittsburgh, PA, USA Finding an equilibrium of an...