2 search results - page 1 / 1 » Explicit Muller Games are PTIME |
FSTTCS
2008
Springer
13 years 6 months ago
2008
Springer
Regular games provide a very useful model for the synthesis of controllers in reactive systems. The complexity of these games depends on the representation of the winning condition...
SIAMCOMP
2010
13 years 3 months ago
2010
We reexamine what it means to compute Nash equilibria and, more generally, what it means to compute a fixed point of a given Brouwer function, and we investigate the complexity o...