9 search results - page 2 / 2 » Computing Nash equilibria for scheduling on restricted paral... |
ESA
2007
Springer
13 years 9 months ago
2007
Springer
We consider the price of selfish routing in terms of tradeoffs and from an average-case perspective. Each player in a network game seeks to send a message with a certain length by...
STACS
1999
Springer
13 years 9 months ago
1999
Springer
We investigate the problem of routing traffic through a congested network in an environment of non-cooperative users. We use the worst-case coordination ratio suggested by Koutsou...
SAGT
2009
Springer
13 years 11 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 ...
MST
2011
13 years 7 days ago
2011
We study the impact of collusion in network games with splittable flow and focus on the well established price of anarchy as a measure of this impact. We first investigate symmet...