Truthful approximation mechanisms for scheduling selfish related machines

Nir Andelman, Yossi Azar, Motti Sorani

Research output: Contribution to journalConference articlepeer-review

Abstract

We consider the problem of scheduling jobs on related machines owned by selfish agents. Previously, Archer and Tardos showed a 2-approximation randomized mechanism which is truthful in expectation only (a weaker notion of truthfulness). We provide a 5-approximation deterministic truthful mechanism, the first deterministic truthful result for the problem. In case the number of machines is constant, we provide a deterministic Fully Polynomial Time Approximation Scheme (FPTAS) algorithm, 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.

Original languageEnglish
Pages (from-to)69-82
Number of pages14
JournalLecture Notes in Computer Science
Volume3404
DOIs
StatePublished - 2005
Event22nd Annual Symposium on Theoretical Aspects of Computer Science, STACS 2005 - Stuttgart, Germany
Duration: 24 Feb 200526 Feb 2005

Fingerprint

Dive into the research topics of 'Truthful approximation mechanisms for scheduling selfish related machines'. Together they form a unique fingerprint.

Cite this