Sciweavers

Share
SAGT
2009
Springer

Non-clairvoyant Scheduling Games

12 years 6 months ago
Non-clairvoyant Scheduling Games
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 each player is the completion time of its own job. In the game, players may follow selfish strategies to optimize their cost and therefore their behaviors do not necessarily lead the game to an equilibrium. Even in the case there is an equilibrium, its makespan might be much larger than the social optimum, and this inefficiency is measured by the price of anarchy – the worst ratio between the makespan of an equilibrium and the optimum. Coordination mechanisms aim to reduce the price of anarchy by designing scheduling policies that specify how jobs assigned to a same machine are to be scheduled. Typically these policies define the schedule according to the processing times as announced by the jobs. One could wonder if there are policies that do not require this knowledge, and still provide a good price of ...
Christoph Dürr, Nguyen Kim Thang
Added 27 May 2010
Updated 27 May 2010
Type Conference
Year 2009
Where SAGT
Authors Christoph Dürr, Nguyen Kim Thang
Comments (0)
books