Abstract. We study envy-free mechanisms for scheduling tasks on unrelated machines (agents) that approximately minimize the makespan. For indivisible tasks, we ...
For indivisible tasks, an envy-free poly-time mechanism is put forward that approximates the minimal makespan to within a factor of O(log m), where m is the ...
Envy-free makespan approximation: extended abstract. Edith Cohen. Michal Feldman. Amos Fiat. Haim Kaplan. Svetlana Olonetsky. EC(2010), pp. 159-166.
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, ...
Sep 6, 2009 · Abstract: We study envy-free mechanisms for scheduling tasks on unrelated machines (agents) that approximately minimize the makespan.
Missing: extended | Show results with:extended
Jun 2, 2023 · Edith Cohen, Michal Feldman, Amos Fiat, Haim Kaplan, Svetlana Olonetsky: Envy-free makespan approximation: extended abstract.
Sep 6, 2009 · Abstract. We study envy-free mechanisms for scheduling tasks on unrelated machines (agents) that approximately minimize the makespan.
ABSTRACT. We study envy-free mechanisms for scheduling tasks on unrelated machines (agents) that approximately minimize the makespan.
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, ...
Abstract. We study envy-free mechanisms for scheduling tasks on unrelated machines (agents) that approximately minimize the makespan. For indivisible tasks ...