Abstract
We study the online version of the scheduling problem involving selfish agents considered by Archer and Tardos [FOCS 2001]: jobs must be scheduled on m parallel related machines, each of them owned by a different selfish agent.
Our study focuses on general techniques to translate approximation/competitive algorithms into equivalent approximation/competitive truthful mechanisms. Our results show that this translation is more problematic in the online setting than in the offline one.For m = 2, we develop an offline and an online “translation” technique which, given anyρ-approximation/competitive (polynomial-time) algorithm, yields an f(ρ)-approximation/competitive (polynomial-time) mechanism, with f(ρ) = ρ(1 + ε) in the offline case, for every ε > 0. By contrast, one of our lower bounds implies that, in general, online ρ-competitive algorithms cannot be turned into ρ(1 + ε)-competitive mechanisms, for some ε > 0 and every m ≥ 2.
We also investigate the issue of designing new online algorithms from scratch so to obtain efficient competitive mechanisms, and prove some lower bounds on a class of “natural” algorithms. Finally, we consider the variant introduced by Nisan and Ronen [STOC 1999] in which machines can be verified. For this model, we give a O(1)-competitive online mechanism for any number of machines and prove that some of the above lower bounds can be broken.
Work supported by the European Project IST-2001-33135, Critical Resource Sharing for Cooperation in Complex Systems (CRESCCO).
Chapter PDF
References
Andelman, N., Azar, Y., Sorani, M.: Truthful approximation mechanisms for scheduling selfish related machines. In: Diekert, V., Durand, B. (eds.) STACS 2005. LNCS, vol. 3404, pp. 69–82. Springer, Heidelberg (2005)
Archer, A., Tardos, E.: Truthful mechanisms for one-parameter agents. In: Proc. of the IEEE Symposium on Foundations of Computer Science (FOCS), pp. 482–491 (2001)
Aspnes, J., Azar, Y., Fiat, A., Plotkin, S.A., Waarts, O.: On-line routing of virtual circuits with applications to load balancing and machine scheduling. Journal of the ACM 44(3), 486–504 (1997)
Auletta, V., De Prisco, R., Penna, P., Persiano, G.: Deterministic truthful approximation mechanisms for scheduling related machines. In: Diekert, V., Habib, M. (eds.) STACS 2004. LNCS, vol. 2996, pp. 608–619. Springer, Heidelberg (2004)
Auletta, V., De Prisco, R., Penna, P., Persiano, G.: On designing truthful mechanisms for online scheduling. Technical report, European Project CRESCCO (2004), http://www.ceid.upatras.gr/crescco/
Auletta, V., De Prisco, R., Penna, P., Persiano, G.: The power of verification for one-parameter agents. In: Díaz, J., Karhumäki, J., Lepistö, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol. 3142, pp. 171–182. Springer, Heidelberg (2004)
Azar, Y.: Online load balancing. In: Online algorithms - the state of the art, pp. 178–195. Springer, Heidelberg (1998)
Graham, R.L.: Bounds for certain multiprocessing anomalies. Bell System Technical Journal 45, 1563–1581 (1966)
Nisan, N., Ronen, A.: Algorithmic Mechanism Design. In: Proc. of the 31st Annual ACM Symposium on Theory of Computing (STOC), pp. 129–140 (1999)
Vickrey, W.: Counterspeculation, Auctions and Competitive Sealed Tenders. Journal of Finance, 8–37 (1961)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Auletta, V., De Prisco, R., Penna, P., Persiano, G. (2005). On Designing Truthful Mechanisms for Online Scheduling. In: Pelc, A., Raynal, M. (eds) Structural Information and Communication Complexity. SIROCCO 2005. Lecture Notes in Computer Science, vol 3499. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11429647_3
Download citation
DOI: https://doi.org/10.1007/11429647_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-26052-3
Online ISBN: 978-3-540-32073-9
eBook Packages: Computer ScienceComputer Science (R0)