A truthful constant approximation for maximizing the minimum load on related machines

Authors:
George Christodoulou;Annamária Kovács;Rob van Stee
Affiliations:
Cluster of Excellence "Multimodal Computing and Interaction", Saarland University, Saarbrücken, Germany and Max Planck Institute for Informatics, Saarbrücken, Germany;Department of Informatics, Goethe University, Frankfurt am Main, Germany;Max Planck Institute for Informatics, Saarbrücken, Germany
Venue:
WINE'10 Proceedings of the 6th international conference on Internet and network economics
Year:
2010

Citing 16
Cited 0

A polynomial approximation scheme for scheduling on uniform processors: Using the dual approximation approach

SIAM Journal on Computing
Approximation Schemes for Covering and Scheduling on Related Machines

APPROX '98 Proceedings of the International Workshop on Approximation Algorithms for Combinatorial Optimization
On-Line Machine Covering

ESA '97 Proceedings of the 5th Annual European Symposium on Algorithms
Truthful Mechanisms for One-Parameter Agents

FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Approximation Schemes for Scheduling on Uniformly Related and Identical Parallel Machines

Algorithmica
Approximation schemes for scheduling and covering on unrelated machines

Theoretical Computer Science
An approximation algorithm for max-min fair allocation of indivisible goods

Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Setting lower bounds on truthfulness: extended abstract

SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
On allocations that maximize fairness

Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Truthful Approximation Schemes for Single-Parameter Agents

FOCS '08 Proceedings of the 2008 49th Annual IEEE Symposium on Foundations of Computer Science
MaxMin allocation via degree lower-bounded arborescences

Proceedings of the forty-first annual ACM symposium on Theory of computing
Maximizing the minimum load for selfish agents

Theoretical Computer Science
On Allocating Goods to Maximize Fairness

FOCS '09 Proceedings of the 2009 50th Annual IEEE Symposium on Foundations of Computer Science
A deterministic truthful PTAS for scheduling related machines

SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
A robust PTAS for machine covering and packing

ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
A polynomial-time approximation scheme for maximizing the minimum machine completion time

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

Designing truthful mechanisms for scheduling on related machines is a very important problem in single-parameter mechanism design.We consider the covering objective, that is we are interested in maximizing the minimum completion time of a machine. This problem falls into the class of problems where the optimal allocation can be truthfully implemented. A major open issue for this class is whether truthfulness affects the polynomial-time implementation. We provide the first constant factor approximation for deterministic truthful mechanisms. In particular we come up with a 2 + ε approximation guarantee, significantly improving on the previous upper bound of min(m, (2 + ε)sm/s1).