Sciweavers

Share
3 search results - page 1 / 1
» (Almost) optimal coordination mechanisms for unrelated machi...
Sort
View
SAGT
2009
Springer
136views Game Theory» more  SAGT 2009»
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 ...
Christoph Dürr, Nguyen Kim Thang
ESA
2008
Springer
195views Algorithms» more  ESA 2008»
12 years 1 months ago
A Characterization of 2-Player Mechanisms for Scheduling
We study the mechanism design problem of scheduling unrelated machines and we completely characterize the decisive truthful mechanisms for two players when the domain contains bot...
George Christodoulou, Elias Koutsoupias, Angelina ...
books