Envy-Free Makespan Approximation

DOI10.1137/100801597zbMath1238.91013arXiv0909.1072OpenAlexW2081331628MaRDI QIDQ2884571

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

Publication date: 30 May 2012

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0909.1072

zbMATH Keywords

schedulingenvy-freealgorithmic mechanism design

Mathematics Subject Classification ID

(n)-person games, (n>2) (91A06) Computational methods for problems pertaining to game theory, economics, and finance (91-08)

Related Items (4)

Combinatorial Walrasian Equilibrium ⋮ The price of envy-freeness in machine scheduling ⋮ A lower bound of \(1+\varphi \) for truthful scheduling mechanisms ⋮ Fair by design: multidimensional envy-free mechanisms

This page was built for publication: Envy-Free Makespan Approximation