ESA
2009
Springer
14 years 11 hour 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 ...
COCOON
2009
Springer
14 years 15 hour 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...
ATAL
2009
Springer
14 years 19 hour ago
2009
Springer
While the class of congestion games has been thoroughly studied in the multi-agent systems literature, settings with incomplete information have received relatively little attenti...
WINE
2009
Springer
14 years 1 days ago
2009
Springer
We study convergence of ε-Nash dynamics in congestion games when delay functions of all resources are similar. Delay functions are said to be similar if their values are within a...
WINE
2009
Springer
14 years 1 days ago
2009
Springer
Congestion games are a fundamental and widely studied model for selfish allocation problems like routing and load balancing. An intrinsic property of these games is that players ...
BIRTHDAY
2009
Springer
14 years 7 days ago
2009
Springer
We introduce a new class of games, asynchronous congestion games (ACGs). In an ACG, each player has a task that can be carried out by any element of a set of resources, and each r...
STOC
2006
ACM
14 years 5 months ago
2006
ACM