Abstract
We consider the problem of designing truthful mechanisms for scheduling n tasks on a set of m parallel related machines in order to minimize the makespan. In what follows, we consider that each task is owned by a selfish agent. This is a variant of the KP-model introduced by Koutsoupias and Papadimitriou (Proc. of STACS 1999, pp. 404–413, 1999) (and of the CKN-model of Christodoulou et al. in Proc. of ICALP 2004, pp. 345–357, 2004) in which the agents cannot choose the machine on which their tasks will be executed. This is done by a centralized authority, the scheduler. However, the agents may manipulate the scheduler by providing false information regarding the length of their tasks. We introduce the notion of increasing algorithm and a simple reduction that transforms any increasing algorithm into a truthful one. Furthermore, we show that some of the classical scheduling algorithms are indeed increasing: the LPT algorithm, the PTAS of Graham (SIAM J. Appl. Math. 17(2):416–429, 1969) in the case of two machines, as well as a simple PTAS for the case of m machines, with m a fixed constant. Our results yield a randomized r(1+ε)-approximation algorithm where r is the ratio between the largest and the smallest speed of the related machines. Furthermore, by combining our approach with the classical result of Shmoys et al. (SIAM J. Comput. 24(6):1313–1331, 1995), we obtain a randomized 2r(1+ε)-competitive algorithm. It has to be noticed that these results are obtained without payments, unlike most of the existing works in the field of Mechanism Design. Finally, we show that if payments are allowed then our approach gives a (1+ε)-algorithm for the off-line case with related machines.
Similar content being viewed by others
References
Angel, E., Bampis, E., & Pascual, F. (2005). Truthful algorithms for scheduling selfish tasks on parallel machines. In LNCS : Vol. 3828. Proc. WINE 2005 (pp. 698–707). Berlin: Springer.
Archer, A., & Tardos, E. (2001). Truthful mechanisms for one-parameter agents. In Proc. of FOCS 2001 (pp. 482–491).
Auletta, V., De Prisco, R., Penna, P., & Persiano, P. (2004a). Deterministic truthful approximation mechanisms for scheduling related machines. In Proc. of STACS 2004 (pp. 608–619).
Auletta, V., Penna, P., de Prisco, R., & Persiano, P. (2004b). How to route and tax selfish unsplittable traffic. In Proc. of SPAA 2004 (pp. 196–204).
Azar, Y., & Sorani, M. (2005). Truthful approximation mechanisms for scheduling selfish related machines. In Proc. of STACS 2005 (pp. 69–82).
Christodoulou, G., Koutsoupias, E., & Nanavati, A. (2004). Coordination mechanisms. In LNCS : Vol. 3142. Proc. of ICALP 2004 (pp. 345–357). Berlin: Springer.
Christodoulou, G., Gourvès, L., & Pascual, F. (2007). Scheduling selfish tasks: about the performance of truthful algorithms. In LNCS : Vol. 4598. Proc. of COCOON 2007 (pp. 187–197). Berlin: Springer.
Clarke, E. (1971). Multipart pricing of public goods. Public Choices, 17–33.
Graham, R. (1969). Bounds on multimachine timing anomalies. SIAM Journal on Applied Mathematics, 17(2), 416–429.
Groves, T. (1973). Incentive in teams. Econometrica, 41(4), 617–631.
Koutsoupias, E., & Papadimitriou, C. (1999). Worst-case equilibria. In LNCS : Vol. 1563. Proc. of STACS 1999 (pp. 404–413). Berlin: Springer.
Lewis, H. R., & Papadimitriou, C. H. (1998). NP-completeness. In Elements of the theory of computation. New York: Prentice-Hall.
Mu’alem, A., & Schapira, M. (2007). Setting lower bounds on truthfulness. In Proc. of SODA 2007 (pp. 1143–1152).
Nisan, N., & Ronen, A. (1999). Algorithmic mechanism design. In Proc. STOC 1999 (pp. 129–140).
Shmoys, D. B., Wein, J., & Williamson, D. P. (1995). Scheduling parallel machines on-line. SIAM Journal of Computing, 24(6), 1313–1331.
Vickrey, W. (1961). Counterspeculation, auctions and competitive sealed tenders. Journal of Finance, 16, 8–37.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Angel, E., Bampis, E., Pascual, F. et al. On truthfulness and approximation for scheduling selfish tasks. J Sched 12, 437–445 (2009). https://doi.org/10.1007/s10951-009-0118-8
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10951-009-0118-8