3 search results - page 1 / 1 » (Almost) optimal coordination mechanisms for unrelated machi... |
SODA
2008
ACM
13 years 6 months ago
2008
ACM
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 ...
ESA
2008
Springer
13 years 6 months ago
2008
Springer
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...