Truthful Approximation Mechanisms for Scheduling Selfish Related Machines

@article{Andelman2006TruthfulAM,
  title={Truthful Approximation Mechanisms for Scheduling Selfish Related Machines},
  author={Nir Andelman and Yossi Azar and Motti Sorani},
  journal={Theory of Computing Systems},
  year={2006},
  volume={40},
  pages={423-436}
}
We consider the problem of scheduling jobs on related machines owned by selfish agents. We provide a 5-approximation deterministic truthful mechanism, the first deterministic truthful result for the problem. Previously, Archer and Tardos showed a 2-approximation randomized mechanism which is truthful in expectation only (a weaker notion of truthfulness). In case the number of machines is constant, we provide a deterministic Fully Polynomial-Time Approximation Scheme (FPTAS) and a suitable… CONTINUE READING
Highly Influential
This paper has highly influenced 11 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
49 Citations
17 References
Similar Papers

Citations

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

References

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

Counterspeculation

  • W. Vickery
  • auctions and competitive sealed tenders. Journal…
  • 2007
1 Excerpt

Mechanisms for Discrete Optimization with Rational Agents

  • A. Archer
  • Ph.D. thesis, Cornell University
  • 2004
2 Excerpts

Algorithms

  • C. Papadimitriou
  • games, and the internet. In Proceedings of the…
  • 2001
1 Excerpt

Similar Papers

Loading similar papers…