15 search results - page 3 / 3 » Equilibria for two parallel links: The strong price of anarc... |
SAGT
2009
Springer
14 years 1 months ago
2009
Springer
In a scheduling game, each player owns a job and chooses a machine to execute it. While the social cost is the maximal load over all machines (makespan), the cost (disutility) of ...
ISAAC
2005
Springer
14 years 26 days ago
2005
Springer
We study network load games, a class of routing games in networks which generalize selfish routing games on networks consisting of parallel links. In these games, each user aims t...
INFOCOM
2010
IEEE
13 years 5 months ago
2010
IEEE
—In many scenarios network design is not enforced by a central authority, but arises from the interactions of several self-interested agents. This is the case of the Internet, wh...
CN
2011
13 years 2 months ago
2011
In many scenarios network design is not enforced by a central authority, but arises from the interactions of several self-interested agents. This is the case of the Internet, wher...
SAGA
2007
Springer
14 years 1 months ago
2007
Springer
We consider applications of probabilistic techniques in the framework of algorithmic game theory. We focus on three distinct case studies: (i) The exploitation of the probabilistic...