Abstract
The Max-Min allocation problem is to distribute indivisible goods to people so as to maximize the minimum utility of the people. We show a (2k − 1)-approximation algorithm for Max-Min when there are k people with subadditive utility functions. We also give a k/α-approximation algorithm (for α ≤ k/2) if the utility functions are additive and the utility of an item for a person is restricted to 0, 1 or U for some U > 1. The running time of this algorithm depends exponentially on the parameter α. Both the algorithms are combinatorial, simple and easy to analyze.
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
Asadpour, A., Saberi, A.: An approximation algorithm for max-min fair allocation of indivisible goods. In: STOC 2007 (to appear)
Azar, Y., Epstein, L.: On-line machine covering. J. Sched. 1(2), 67–77 (1998)
Bansal, N., Sviridenko, M.: The santa claus problem. In: STOC 2006. Proceedings of the 38th Annual ACM Symposium on Theory of Computing, pp. 31–40. ACM Press, New York (2006)
Bezáková, I., Dani, V.: Allocating indivisible goods. SIGecom Exchanges 5(3), 11–18 (2005)
Epstein, L.: Tight bounds for bandwidth allocation on two links. Discrete Appl. Math. 148(2), 181–188 (2005)
Golovin, D.: Max-min fair allocation of indivisible goods. Technical Report CMU-CS-05-144, Carnegie Mellon University (2005)
Lehmann, B., Lehmann, D., Nisan, N.: Combinatorial auctions with decreasing marginal utilities. In: EC 2001. Proceedings of the Third ACM Conference on Electronic Commerce, pp. 18–28. ACM Press, New York (2001)
Mjelde, K.M.: Max-min resource allocation. BIT Numerical Mathematics 23(4), 529–537 (1983)
Ramirez-Marquez, J.E., Coit, D.W., Konak, A.: Redundancy allocation for series-parallel systems using a max-min approach. IIE Transactions, 891–898 (2004)
Tan, Z., He, Y., Epstein, L.: Optimal on-line algorithms for the uniform machine scheduling problem with ordinal data. Inf. Comput. 196(1), 57–70 (2005)
Younis, M., Akkaya, K., Kunjithapatham, A.: Optimization of task allocation in a cluster-based sensor network. In: ISCC 2003. Proceedings of the Eighth IEEE International Symposium on Computers and Communications, Washington, DC, USA, 2003, p. 329. IEEE Computer Society Press, Los Alamitos (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Khot, S., Ponnuswami, A.K. (2007). Approximation Algorithms for the Max-Min Allocation Problem. In: Charikar, M., Jansen, K., Reingold, O., Rolim, J.D.P. (eds) Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques. APPROX RANDOM 2007 2007. Lecture Notes in Computer Science, vol 4627. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74208-1_15
Download citation
DOI: https://doi.org/10.1007/978-3-540-74208-1_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74207-4
Online ISBN: 978-3-540-74208-1
eBook Packages: Computer ScienceComputer Science (R0)