On designing truthful mechanisms for online scheduling


We study the online version of the scheduling problem Q||Cmax involving selfish agents, considered by Archer and Tardos in [FOCS 2001], where jobs must be scheduled on m related machines, each of them owned by a different selfish agent. We present a general technique for transforming competitive online algorithms for Q||Cmax into truthful online mechanisms… (More)
DOI: 10.1016/j.tcs.2008.12.057


3 Figures and Tables

Cite this paper

@article{Auletta2005OnDT, title={On designing truthful mechanisms for online scheduling}, author={Vincenzo Auletta and Roberto De Prisco and Paolo Penna and Giuseppe Persiano}, journal={Theor. Comput. Sci.}, year={2005}, volume={410}, pages={3348-3356} }