The Community for Technology Leaders
2008 49th Annual IEEE Symposium on Foundations of Computer Science (2008)
Oct. 25, 2008 to Oct. 28, 2008
ISSN: 0272-5428
ISBN: 978-0-7695-3436-7
pp: 15-24
We present the first monotone randomized polynomial-time approximation scheme (PTAS) for minimizing the makespan of parallel related machines (Q||C_max), the paradigmatic problem in single-parameter algorithmic mechanism design. This result immediately gives a polynomial-time, truthful (in expectation) mechanism whose approximation guarantee attains the best-possible one for all polynomial-time algorithms (assuming P not equal to NP). Our algorithmic techniques are flexible and also yield, among other results, a monotone deterministic quasi-PTAS for Q||C_max and a monotone randomized PTAS for max-min scheduling on related machines.
Algorithmic Mechanism Design, Single Parameter Agents, Monotone Algorithms, Scheduling, Approximation Algorithms

S. Dobzinski, P. Dhangwatnotai, S. Dughmi and T. Roughgarden, "Truthful Approximation Schemes for Single-Parameter Agents," 2008 49th Annual IEEE Symposium on Foundations of Computer Science(FOCS), vol. 00, no. , pp. 15-24, 2008.
96 ms
(Ver 3.3 (11022016))