224 search results - page 19 / 45 » On Nash-Equilibria of Approximation-Stable Games |
179
click to vote
CORR
2011
Springer
14 years 9 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...
162
click to vote
FOCS
2006
IEEE
16 years 3 days ago
2006
IEEE
We advance significantly beyond the recent progress on the algorithmic complexity of Nash equilibria by solving two major open problems in the approximation of Nash equilibria an...
183
click to vote
ICALP
2011
Springer
14 years 9 months ago
2011
Springer
Abstract. Congestion games model several interesting applications, including routing and network formation games, and also possess attractive theoretical properties, including the ...
174
click to vote
ESA
2009
Springer
16 years 18 days ago
2009
Springer
We study the performance of approximate Nash equilibria for congestion games with polynomial latency functions. We consider how much the price of anarchy worsens and how much the ...
127
click to vote
APPROX
2009
Springer
16 years 19 days ago
2009
Springer
Recently, Hazan and Krauthgamer showed [12] that if, for a fixed small ε, an ε-best ε-approximate Nash equilibrium can be found in polynomial time in two-player games, then it ...