3 search results - page 1 / 1 » How Do You Like Your Equilibrium Selection Problems |
SAGT
2010
Springer
13 years 3 months 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 ...
ELPUB
2006
ACM
13 years 10 months ago
2006
ACM
By the end of this year visitors to the Flemish town of Mechelen can discover the city with the help of the new CityInMyPocket walking guide. Instead of following a person or a bo...
ICDT
2005
ACM
13 years 10 months ago
2005
ACM
Abstract. In this paper, we consider whether traditional index structures are effective in processing unstable nearest neighbors workloads. It is known that under broad conditions...