Envy-free makespan approximation
From MaRDI portal
Publication:2884571
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 , where is the number of machines. We also show a lower bound of . This improves the recent result of Hartline {sl et al.} cite{Ahuva:2008} who give an upper bound of , and a lower bound of . For divisible tasks, we show that there always exists an envy-free poly-time mechanism with optimal makespan.
Recommendations
Cited in
(7)- Fair by design: multidimensional envy-free mechanisms
- Lower bound for envy-free and truthful makespan approximation on related machines
- A lower bound of \(1+\varphi \) for truthful scheduling mechanisms
- Combinatorial Walrasian equilibrium
- The price of envy-freeness in machine scheduling
- The price of envy-freeness in machine scheduling
- On Multi-dimensional Envy-Free Mechanisms
This page was built for publication: Envy-free makespan approximation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2884571)