Approximation Schemes for Covering and Scheduling on Related Machines
APPROX '98 Proceedings of the International Workshop on Approximation Algorithms for Combinatorial Optimization
Truthful Mechanisms for One-Parameter Agents
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Iterative combinatorial auctions: achieving economic and computational efficiency
Iterative combinatorial auctions: achieving economic and computational efficiency
Towards a Characterization of Truthful Combinatorial Auctions
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
Mechanisms for discrete optimization with rational agents
Mechanisms for discrete optimization with rational agents
Truthful Approximation Mechanisms for Scheduling Selfish Related Machines
Theory of Computing Systems
Deterministic monotone algorithms for scheduling on related machines
Theoretical Computer Science
On the Hardness of Being Truthful
FOCS '08 Proceedings of the 2008 49th Annual IEEE Symposium on Foundations of Computer Science
Maximizing the minimum load for selfish agents
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Bayesian algorithmic mechanism design
Proceedings of the forty-second ACM symposium on Theory of computing
Inapproximability for VCG-based combinatorial auctions
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
A deterministic truthful PTAS for scheduling related machines
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Black-Box Randomized Reductions in Algorithmic Mechanism Design
FOCS '10 Proceedings of the 2010 IEEE 51st Annual Symposium on Foundations of Computer Science
Fast monotone 3-approximation algorithm for scheduling related machines
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Tighter approximation bounds for LPT scheduling in two special cases
CIAC'06 Proceedings of the 6th Italian conference on Algorithms and Complexity
Mechanisms for scheduling with single-bit private values
SAGT'12 Proceedings of the 5th international conference on Algorithmic Game Theory
The cost of selfishness for maximizing the minimum load on uniformly related machines
Journal of Combinatorial Optimization
| Hi-index | 0.00 |
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\neq NP$). Our algorithmic techniques are flexible and also yield a monotone deterministic quasi-PTAS for $Q||C_{\max}$ and a monotone randomized PTAS for max-min scheduling on related machines.