TY - JOUR
T1 - Truthful approximation mechanisms for scheduling selfish related machines
AU - Andelman, Nir
AU - Azar, Yossi
AU - Sorani, Motti
N1 - Funding Information:
∗ A preliminary version of this paper appears in the Proceedings of the 22nd International Symposium on Theoretical Aspects of Computer Science (STACS), 2005, pp. 69–82. Nir Andelman’s research was supported in part by the Israel Science Foundation. Yossi Azar’s research was supported in part by the German Israeli Foundation.
PY - 2007/6
Y1 - 2007/6
N2 - We consider the problem of scheduling jobs on related machines owned by selfish agents. We provide a 5-approximation deterministic truthful mechanism, the first deterministic truthful result for the problem. Previously, Archer and Tardos showed a 2-approximation randomized mechanism which is truthful in expectation only (a weaker notion of truthfulness). In case the number of machines is constant, we provide a deterministic Fully Polynomial-Time Approximation Scheme (FPTAS) and a suitable payment scheme that yields a truthful mechanism for the problem. This result, which is based on converting FPTAS to monotone FPTAS, improves a previous result of Auletta et al., who showed a (4 + ε)-approximation truthful mechanism.
AB - We consider the problem of scheduling jobs on related machines owned by selfish agents. We provide a 5-approximation deterministic truthful mechanism, the first deterministic truthful result for the problem. Previously, Archer and Tardos showed a 2-approximation randomized mechanism which is truthful in expectation only (a weaker notion of truthfulness). In case the number of machines is constant, we provide a deterministic Fully Polynomial-Time Approximation Scheme (FPTAS) and a suitable payment scheme that yields a truthful mechanism for the problem. This result, which is based on converting FPTAS to monotone FPTAS, improves a previous result of Auletta et al., who showed a (4 + ε)-approximation truthful mechanism.
UR - http://www.scopus.com/inward/record.url?scp=34547224625&partnerID=8YFLogxK
U2 - 10.1007/s00224-006-1316-9
DO - 10.1007/s00224-006-1316-9
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:34547224625
SN - 1432-4350
VL - 40
SP - 423
EP - 436
JO - Theory of Computing Systems
JF - Theory of Computing Systems
IS - 4
ER -