800 search results - page 49 / 160 » On the Complexity of Parity Games |
DIGRA
2005
Springer
14 years 2 months ago
2005
Springer
This illustrated paper reports on the early digital games industry in New Zealand, during the late 1970s and 80s. It presents an overview of this largely unknown history, drawing ...
COCO
2010
Springer
14 years 1 months ago
2010
Springer
—Raz’s parallel repetition theorem [21] together with improvements of Holenstein [12] shows that for any two-prover one-round game with value at most 1 − (for ≤ 1/2), the v...
JAIR
2011
13 years 4 days ago
2011
There has been significant recent interest in game theoretic approaches to security, with much of the recent research focused on utilizing the leader-follower Stackelberg game mo...
FLAIRS
1998
13 years 10 months ago
1998
In somecomplexdomains,like the gameof Go,evaluating a position is not simple. In other games,like Chessfor example,material balancegives goodandfast to compute insight onthe value...
SIAMCOMP
2010
13 years 7 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...