Join Our Newsletter
2 search results - page 1 / 1 » How Do You Like Your Equilibrium Selection Problems? Hard, o... |
SAGT
2010
Springer
12 years 11 days ago
2010
Springer
The PPAD-completeness of Nash equilibrium computation is taken as evidence that the problem is computationally hard in the worst case. This evidence is necessarily rather weak, in ...
SIGOPSE
1998
ACM
12 years 6 months ago
1998
ACM
with this, the thread abstraction was introduced. While threads are handling events, or awaiting speciļ¬c events, unrelated events can be handled by other threads. Unfortunately, ...
