Envy-free makespan approximation

Edith Cohen; Michal Feldman; Amos Fiat; Haim Kaplan; Svetlana Olonetsky

doi:10.1145/1807342.1807368

Envy-free makespan approximation

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

^*Corresponding author for this work

School of Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

8 Scopus citations

Abstract

We study envy-free mechanisms for scheduling tasks on unrelated machines (agents) that approximately minimize the makespan. For indivisible tasks, we put forward an envy-free poly-time mechanism that approximates the minimal makespan to within a factor of O(log m), where m is the number of machines. We also show a lower bound of Ω(log m / log log m). This improves the recent result of Mu'alem [22] who give 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 language	English
Title of host publication	EC'10 - Proceedings of the 2010 ACM Conference on Electronic Commerce
Pages	159-165
Number of pages	7
DOIs	https://doi.org/10.1145/1807342.1807368
State	Published - 2010
Event	11th ACM Conference on Electronic Commerce, EC'10 - Cambridge, MA, United States Duration: 7 Jun 2010 → 11 Jun 2010

Publication series

Name	Proceedings of the ACM Conference on Electronic Commerce

Conference

Conference	11th ACM Conference on Electronic Commerce, EC'10
Country/Territory	United States
City	Cambridge, MA
Period	7/06/10 → 11/06/10

Keywords

envy free
job scheduling
makespan

Access to Document

10.1145/1807342.1807368

Cite this

@inproceedings{548946d8a2da40a38ee7a4d9c0d0b145,

title = "Envy-free makespan approximation",

abstract = "We study envy-free mechanisms for scheduling tasks on unrelated machines (agents) that approximately minimize the makespan. For indivisible tasks, we put forward an envy-free poly-time mechanism that approximates the minimal makespan to within a factor of O(log m), where m is the number of machines. We also show a lower bound of Ω(log m / log log m). This improves the recent result of Mu'alem [22] who give 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.",

keywords = "envy free, job scheduling, makespan",

author = "Edith Cohen and Michal Feldman and Amos Fiat and Haim Kaplan and Svetlana Olonetsky",

year = "2010",

doi = "10.1145/1807342.1807368",

language = "אנגלית",

isbn = "9781605588223",

series = "Proceedings of the ACM Conference on Electronic Commerce",

pages = "159--165",

booktitle = "EC'10 - Proceedings of the 2010 ACM Conference on Electronic Commerce",

note = "11th ACM Conference on Electronic Commerce, EC'10 ; Conference date: 07-06-2010 Through 11-06-2010",

}

Cohen, E, Feldman, M , Fiat, A , Kaplan, H & Olonetsky, S 2010, Envy-free makespan approximation. in EC'10 - Proceedings of the 2010 ACM Conference on Electronic Commerce. Proceedings of the ACM Conference on Electronic Commerce, pp. 159-165, 11th ACM Conference on Electronic Commerce, EC'10, Cambridge, MA, United States, 7/06/10. https://doi.org/10.1145/1807342.1807368

TY - GEN

T1 - Envy-free makespan approximation

AU - Cohen, Edith

AU - Feldman, Michal

AU - Fiat, Amos

AU - Kaplan, Haim

AU - Olonetsky, Svetlana

PY - 2010

Y1 - 2010

N2 - We study envy-free mechanisms for scheduling tasks on unrelated machines (agents) that approximately minimize the makespan. For indivisible tasks, we put forward an envy-free poly-time mechanism that approximates the minimal makespan to within a factor of O(log m), where m is the number of machines. We also show a lower bound of Ω(log m / log log m). This improves the recent result of Mu'alem [22] who give 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.

AB - We study envy-free mechanisms for scheduling tasks on unrelated machines (agents) that approximately minimize the makespan. For indivisible tasks, we put forward an envy-free poly-time mechanism that approximates the minimal makespan to within a factor of O(log m), where m is the number of machines. We also show a lower bound of Ω(log m / log log m). This improves the recent result of Mu'alem [22] who give 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.

KW - envy free

KW - job scheduling

KW - makespan

UR - http://www.scopus.com/inward/record.url?scp=77954695254&partnerID=8YFLogxK

U2 - 10.1145/1807342.1807368

DO - 10.1145/1807342.1807368

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:77954695254

SN - 9781605588223

T3 - Proceedings of the ACM Conference on Electronic Commerce

SP - 159

EP - 165

BT - EC'10 - Proceedings of the 2010 ACM Conference on Electronic Commerce

T2 - 11th ACM Conference on Electronic Commerce, EC'10

Y2 - 7 June 2010 through 11 June 2010

ER -

Envy-free makespan approximation

Abstract

Publication series

Conference

Keywords

Access to Document

Other files and links

Fingerprint

Cite this