Envy-Free Makespan Approximation
From MaRDI portal
Publication:2884571
DOI10.1137/100801597zbMath1238.91013arXiv0909.1072MaRDI QIDQ2884571
Haim Kaplan, Michal Feldman, Amos Fiat, Edith Cohen, Svetlana Olonetsky
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
91A06: (n)-person games, (n>2)
91-08: Computational methods for problems pertaining to game theory, economics, and finance
Related Items
A lower bound of \(1+\varphi \) for truthful scheduling mechanisms, Fair by design: multidimensional envy-free mechanisms