Deterministic Truthful Approximation Mechanisms for Scheduling Related Machines

@inproceedings{Auletta2004DeterministicTA,
  title={Deterministic Truthful Approximation Mechanisms for Scheduling Related Machines},
  author={Vincenzo Auletta and Roberto De Prisco and Paolo Penna and Giuseppe Persiano},
  booktitle={STACS},
  year={2004}
}
We consider the problem of scheduling jobs on parallel related machines owned by selfish agents. We provide deterministic polynomial-time (2 + ǫ)-approximation algorithms and suitable payment functions that yield truthful mechanisms for several NP-hard restrictions of this problem. Up to our knowledge, our result is the first non-trivial polynomial-time deterministic truthful mechanism for this NP-hard problem. Our result also yields a family of deterministic polynomial-time truthful (4… CONTINUE READING

Citations

Publications citing this paper.
Showing 1-10 of 39 extracted citations

Asynchronous Congestion Games

Graph Theory, Computational Intelligence and Thought • 2009
View 5 Excerpts
Highly Influenced

Random Order Congestion Games

Math. Oper. Res. • 2009
View 5 Excerpts
Highly Influenced

References

Publications referenced by this paper.
Showing 1-10 of 13 references

Computationally feasible VCG mechanisms

View 5 Excerpts
Highly Influenced

Bounds for certain multiprocessing anomalies

R. L. Graham
Bell System Tech. Journal, 45:1563– 1581 • 1966
View 5 Excerpts
Highly Influenced

Algorithmic Mechanism Design

Games and Economic Behavior • 2001
View 10 Excerpts
Highly Influenced

Algorithms

C. H. Papadimitriou
Games, and the Internet. In Proc. of the 33rd STOC • 2001
View 1 Excerpt

Counterspeculation , Auctions and Competitive Sealed Tenders

W. Vickrey.
Solving Optimization Problems Among Selfish Agents . PhD thesis , Hebrew University in Jerusalem , • 2000

Similar Papers

Loading similar papers…