36 search results - page 1 / 8 » A Characterization of 2-Player Mechanisms for Scheduling |
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...
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...
ISLPED
2010
ACM
13 years 5 months ago
2010
ACM
Runtime characteristics of individual threads (such as IPC, cache usage, etc.) are a critical factor in making efficient scheduling decisions in modern chip-multiprocessor systems...
ISPDC
2005
IEEE
13 years 10 months ago
2005
IEEE
An important scheduling problem is the one in which there are no dependencies between tasks and the tasks can be of arbitrary size. This is known as the divisible load scheduling ...
ICPP
2008
IEEE
13 years 11 months ago
2008
IEEE
We design an incentive-compatible mechanism for scheduling n non-malleable parallel jobs on a parallel system comprising m identical processors. Each job is owned by a selfish us...