13 search results - page 1 / 3 » An Improved Randomized Truthful Mechanism for Scheduling Unr... |
CORR
2008
Springer
13 years 5 months ago
2008
Springer
We study the scheduling problem on unrelated machines in the mechanism design setting. This problem was proposed and studied in the seminal paper of Nisan and
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...
LATIN
2010
Springer
13 years 7 months ago
2010
Springer
We study the problem of designing truthful algorithms for scheduling a set of tasks, each one owned by a selfish agent, to a set of parallel (identical or unrelated) machines in or...
SIGECOM
2008
ACM
13 years 5 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...
ISPAN
2005
IEEE
13 years 10 months ago
2005
IEEE
In classical mechanism design setting the outcome of the mechanism is computed by a trusted central party. In this paper we consider distributed implementations in which the outco...