Lower Bound for Envy-Free and Truthful Makespan Approximation on Related Machines

DOI10.1007/978-3-642-24829-0_16zbMath1233.90154arXiv1107.2957OpenAlexW1573323211MaRDI QIDQ3095271

Lisa K. Fleischer, Zhenghui Wang

Publication date: 28 October 2011

Published in: Algorithmic Game Theory (Search for Journal in Brave)

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

zbMATH Keywords

envy-freemechanism designincentive compatiblemakespan approximation

Mathematics Subject Classification ID

Applications of game theory (91A80) Deterministic scheduling theory in operations research (90B35)

This page was built for publication: Lower Bound for Envy-Free and Truthful Makespan Approximation on Related Machines