24 search results - page 1 / 5 » On the Performance of Approximate Equilibria in Congestion G... |
ESA
2009
Springer
13 years 11 months 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 ...
SIROCCO
2008
13 years 6 months ago
2008
We consider the problem of computing -approximate Nash equilibria in network congestion games. The general problem is known to be PLS-complete for every > 0, but the reductions...
MOBIHOC
2012
ACM
11 years 7 months ago
2012
ACM
A key feature of wireless communications is the spatial reuse. However, the spatial aspect is not yet well understood for the purpose of designing efficient spectrum sharing mecha...
COCOON
2009
Springer
13 years 11 months ago
2009
Springer
: Network games play a fundamental role in understanding behavior in many domains, ranging from communication networks through markets to social networks. Such networks are used, a...
INFOCOM
2003
IEEE
13 years 10 months ago
2003
IEEE
— A generic mechanism for end-user transmission rate control into a differentiated services Internet is formulated and basic results of corresponding Nash equilibria are proved. ...