13 search results - page 1 / 3 » Deterministic Truthful Approximation Mechanisms for Scheduli... |
STACS
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. We consider the problem of scheduling jobs on related machines owned by selfish agents and provide the first deterministic mechanisms with constant approximation that a...
CORR
2011
Springer
12 years 8 months ago
2011
Springer
We study problems of scheduling jobs on related machines so as to minimize the makespan in the setting where machines are strategic agents. In this problem, each job j has a lengt...
SODA
2010
ACM
14 years 2 months ago
2010
ACM
ICALP
2007
Springer
13 years 11 months ago
2007
Springer
In this paper, we consider the mechanism design version of the fractional variant of the scheduling problem on unrelated machines. We give a lower bound of 2 − 1/n for any fracti...
SIGECOM
2008
ACM
13 years 4 months ago
2008
ACM
We characterize truthful mechanisms in two multi-parameter domains. The first characterization shows that every mechanism for combinatorial auctions with two subadditive bidders t...