A characterization of 2-player mechanisms for scheduling

22Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We study the mechanism design problem for scheduling unrelated machines and we completely characterize the decisive truthful mechanisms for two players when the domain contains both positive and negative values. We show that the class of truthful mechanisms is very limited: A decisive truthful mechanism partitions the tasks into groups so that tasks in each group are allocated independently of the other groups. Tasks in a group of size at least two are allocated by an affine minimizer and tasks in singleton groups by a task-independent mechanism. This characterization is about all truthful mechanisms, including those with unbounded approximation ratio. A direct consequence of this approach is that the approximation ratio of mechanisms for two players is 2, even for two tasks. In fact, it follows that for two players, VCG is the unique algorithm with optimal approximation 2. © 2008 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Christodoulou, G., Koutsoupias, E., & Vidali, A. (2008). A characterization of 2-player mechanisms for scheduling. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5193 LNCS, pp. 297–307). Springer Verlag. https://doi.org/10.1007/978-3-540-87744-8_25

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free