11 search results - page 1 / 3 » Worst-case Equilibria |
ESA
2010
Springer
13 years 5 months ago
2010
Springer
We characterize the price of anarchy in weighted congestion games, as a function of the allowable resource cost functions. Our results provide as thorough an understanding of this ...
CORR
2011
Springer
12 years 8 months ago
2011
Springer
This article investigates selfish behavior in games where players are embedded in a social context. A framework is presented which allows us to measure the Windfall of Friendship...
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 ...
AMC
2007
13 years 4 months ago
2007
The new economic geography literature provides a general equilibrium framework that explains the emergence of economic agglomerations as a trade-off between increasing returns at...
CORR
2010
Springer
13 years 3 months ago
2010
Springer
Finding approximate Nash equilibria in n × n bimatrix games is currently one of the main open problems in algorithmic game theory. Motivated in part by the lack of progress on wo...