Sciweavers

Share
2 search results - page 1 / 1
» How Do You Like Your Equilibrium Selection Problems? Hard, o...
Sort
View
SAGT
2010
Springer
160views Game Theory» more  SAGT 2010»
11 years 10 months ago
How Do You Like Your Equilibrium Selection Problems? Hard, or Very Hard?
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 ...
Paul W. Goldberg
SIGOPSE
1998
ACM
12 years 4 months ago
Goal-oriented programming, or composition using events, or threads considered harmful
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, ...
Robbert van Renesse
books