9 search results - page 1 / 2 » Computing Nash equilibria for scheduling on restricted paral... |
STOC
2004
ACM
14 years 5 months ago
2004
ACM
ICALP
2003
Springer
13 years 10 months ago
2003
Springer
We study the number of steps required to reach a pure Nash Equilibrium in a load balancing scenario where each job behaves selfishly and attempts to migrate to a machine which will...
ISAAC
2005
Springer
13 years 10 months 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...
DAGSTUHL
2007
13 years 6 months ago
2007
Following recent interest in the strong price of anarchy (SPOA), we consider this measure, as well as the well known price of anarchy (POA) for the job scheduling problem on two u...
PODC
2003
ACM
13 years 10 months ago
2003
ACM
We introduce a novel game that models the creation of Internet-like networks by selfish node-agents without central design or coordination. Nodes pay for the links that they esta...