Abstract
Designing truthful mechanisms for scheduling on related machines is a very important problem in single-parameter mechanism design. We consider the covering objective, that is we are interested in maximizing the minimum completion time of a machine. This problem falls into the class of problems where the optimal allocation can be truthfully implemented. A major open issue for this class is whether truthfulness affects the polynomial-time implementation.
We provide the first constant factor approximation for deterministic truthful mechanisms. In particular we come up with a 2 + ε approximation guarantee, significantly improving on the previous upper bound of min(m,(2+ε)s m /s 1).
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Archer, A., Tardos, É.: Truthful mechanisms for one-parameter agents. In: Proc. 42nd Annual Symposium on Foundations of Computer Science, pp. 482–491 (2001)
Asadpour, A., Saberi, A.: An approximation algorithm for max-min fair allocation of indivisible goods. In: Proc. 39th Annual ACM Symp. Theory of Comp. (STOC), pp. 114–121. ACM, New York (2007)
Azar, Y., Epstein, L.: On-line machine covering. In: Burkard, R.E., Woeginger, G.J. (eds.) ESA 1997. LNCS, vol. 1284, pp. 23–36. Springer, Heidelberg (1997)
Azar, Y., Epstein, L.: Approximation schemes for covering and scheduling on related machines. In: Jansen, K., Rolim, J.D.P. (eds.) APPROX 1998. LNCS, vol. 1444, pp. 39–47. Springer, Heidelberg (1998)
Bateni, M., Charikar, M., Guruswami, V.: Maxmin allocation via degree lower-bounded arborescences. In: Proc. 41st Annual ACM Symp. Theory of Comp., pp. 543–552. ACM, New York (2009)
Chakrabarty, D., Chuzhoy, J., Khanna, S.: On allocating goods to maximize fairness. In: Proc. 50th Annual IEEE Symp. on Found. of Comp. Sci. (FOCS), pp. 107–116. IEEE Computer Society, Los Alamitos (2009)
Christodoulou, G., Kovács, A.: A deterministic truthful PTAS for scheduling related machines. In: Proc. 21st SIAM Symp. on Disc. Algs. (SODA), pp. 1005–1016. SIAM, Philadelphia (2010)
Dhangwatnotai, P., Dobzinski, S., Dughmi, S., Roughgarden, T.: Truthful approximation schemes for single-parameter agents. In: Proc. 49th IEEE Symp. on Found. of Comp. Sci., FOCS (2008)
Efraimidis, P.S., Spirakis, P.G.: Approximation schemes for scheduling and covering on unrelated machines. Theoretical Computer Science 359(1-3), 400–417 (2006)
Epstein, L., Sgall, J.: Approximation schemes for scheduling on uniformly related and identical parallel machines. Algorithmica 39(1), 43–57 (2004)
Epstein, L., van Stee, R.: Maximizing the minimum load for selfish agents. Theoretical Computer Science 411(1), 44–57 (2010)
Feige, U.: On allocations that maximize fairness. In: Proc. 19th annual ACM-SIAM Symp. Discr. Algs. (SODA), pp. 287–293. SIAM, Philadelphia (2008)
Hochbaum, D.S., Shmoys, D.B.: A polynomial approximation scheme for scheduling on uniform processors: Using the dual approximation approach. SIAM Journal on Computing 17(3), 539–551 (1988)
Mu’alem, A., Schapira, M.: Setting lower bounds on truthfulness. In: Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 1143–1152 (2007)
Myerson, R.B.: Optimal auction design. Mathematics of Operations Research 6, 58–73 (1981)
Skutella, M., Verschae, J.: A robust PTAS for machine covering and packing. In: de Berg, M., Meyer, U. (eds.) ESA 2010. LNCS, vol. 6346, pp. 36–47. Springer, Heidelberg (2010)
Woeginger, G.J.: A polynomial time approximation scheme for maximizing the minimum machine completion time. Operations Research Letters 20(4), 149–154 (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Christodoulou, G., Kovács, A., van Stee, R. (2010). A Truthful Constant Approximation for Maximizing the Minimum Load on Related Machines. In: Saberi, A. (eds) Internet and Network Economics. WINE 2010. Lecture Notes in Computer Science, vol 6484. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-17572-5_15
Download citation
DOI: https://doi.org/10.1007/978-3-642-17572-5_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-17571-8
Online ISBN: 978-3-642-17572-5
eBook Packages: Computer ScienceComputer Science (R0)