Envy-free makespan approximation

Edith Cohen*, Michal Feldman, Amos Fiat, Haim Kaplan, Svetlana Olonetsky

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

Abstract

We study envy-free mechanisms for assigning tasks to agents, where every task may take a different amount of time to perform by each agent, and the goal is to get all the tasks done as soon as possible (i.e., minimize the makespan). For indivisible tasks, we put forward an envy-free polynomial mechanism that approximates the minimal makespan to within a factor of O(logm), where m is the number of machines. This bound is almost tight, as we also show that no envy-free mechanism can achieve a better bound than Ω(log m/log logm). This improves the recent result of Mu'alem [On multi-dimensional envy-free mechanisms, in Proceedings of the First International Conference on Algorithmic Decision Theory, F. Rossi and A. Tsoukias, eds., Lecture Notes in Comput. Sci. 5783, Springer, Berlin, 2009, pp. 120-131] who introduced the model and gave an upper bound of (m+1)/2 and a lower bound of 2-1/m. For divisible tasks, we show that there always exists an envy-free poly-time mechanism with optimal makespan. Finally, we demonstrate how our mechanism for envy-free makespan minimization can be interpreted as a market clearing problem.

Original languageEnglish
Pages (from-to)12-25
Number of pages14
JournalSIAM Journal on Computing
Volume41
Issue number1
DOIs
StatePublished - 2012

Keywords

  • Algorithmic mechanism design
  • Envy-free
  • Scheduling

Fingerprint

Dive into the research topics of 'Envy-free makespan approximation'. Together they form a unique fingerprint.

Cite this