33 search results - page 6 / 7 » A Deterministic Subexponential Algorithm for Solving Parity ... |
CAV
2009
Springer
14 years 9 months ago
2009
Springer
Abstract. Most specification languages express only qualitative constraints. However, among two implementations that satisfy a given specification, one may be preferred to another....
STOC
2001
ACM
14 years 8 months ago
2001
ACM
We consider two-player games played for an infinite number of rounds, with -regular winning conditions. The games may be concurrent, in that the players choose their moves simulta...
CAV
2003
Springer
14 years 1 months ago
2003
Springer
We show that the model checking problem for µ-calculus on graphs of bounded tree-width can be solved in time linear in the size of the system. The result is presented by first sh...
SAGT
2009
Springer
14 years 3 months ago
2009
Springer
We study Nash equilibria and the price of anarchy in the context of flows over time. Many results on static routing games have been obtained over the last ten years. In flows ov...
ATAL
2010
Springer
13 years 9 months ago
2010
Springer
Games are used to evaluate and advance Multiagent and Artificial Intelligence techniques. Most of these games are deterministic with perfect information (e.g. Chess and Checkers)....