Approximation algorithms for the max-min allocation problem

Subhash Khot; Ashok Kumar Ponnuswami

doi:10.1007/978-3-540-74208-1_15

Approximation algorithms for the max-min allocation problem

Subhash Khot, Ashok Kumar Ponnuswami

Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

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 fc/a-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.

Original language	English (US)
Title of host publication	Approximation, Randomization, and Combinatorial Optimization
Subtitle of host publication	Algorithms and Techniques - 10th International Workshop, APPROX 2007 and 11th International Workshop, RANDOM 2007, Proceedings
Publisher	Springer Verlag
Pages	204-217
Number of pages	14
ISBN (Print)	9783540742074
DOIs	https://doi.org/10.1007/978-3-540-74208-1_15
State	Published - 2007
Event	10th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2007 and 11th International Workshop on Randomization and Computation, RANDOM 2007 - Princeton, NJ, United States Duration: Aug 20 2007 → Aug 22 2007

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	4627 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Other

Other	10th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2007 and 11th International Workshop on Randomization and Computation, RANDOM 2007
Country/Territory	United States
City	Princeton, NJ
Period	8/20/07 → 8/22/07

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Access to Document

10.1007/978-3-540-74208-1_15

Cite this

Khot, S., & Ponnuswami, A. K. (2007). Approximation algorithms for the max-min allocation problem. In Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques - 10th International Workshop, APPROX 2007 and 11th International Workshop, RANDOM 2007, Proceedings (pp. 204-217). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4627 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-540-74208-1_15

Approximation algorithms for the max-min allocation problem. / Khot, Subhash; Ponnuswami, Ashok Kumar.
Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques - 10th International Workshop, APPROX 2007 and 11th International Workshop, RANDOM 2007, Proceedings. Springer Verlag, 2007. p. 204-217 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4627 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Khot, S & Ponnuswami, AK 2007, Approximation algorithms for the max-min allocation problem. in Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques - 10th International Workshop, APPROX 2007 and 11th International Workshop, RANDOM 2007, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 4627 LNCS, Springer Verlag, pp. 204-217, 10th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2007 and 11th International Workshop on Randomization and Computation, RANDOM 2007, Princeton, NJ, United States, 8/20/07. https://doi.org/10.1007/978-3-540-74208-1_15

Khot S, Ponnuswami AK. Approximation algorithms for the max-min allocation problem. In Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques - 10th International Workshop, APPROX 2007 and 11th International Workshop, RANDOM 2007, Proceedings. Springer Verlag. 2007. p. 204-217. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-540-74208-1_15

Khot, Subhash ; Ponnuswami, Ashok Kumar. / Approximation algorithms for the max-min allocation problem. Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques - 10th International Workshop, APPROX 2007 and 11th International Workshop, RANDOM 2007, Proceedings. Springer Verlag, 2007. pp. 204-217 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{75070132465f4cd3a74ec0ed0aac967d,

title = "Approximation algorithms for the max-min allocation problem",

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 fc/a-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.",

author = "Subhash Khot and Ponnuswami, {Ashok Kumar}",

year = "2007",

doi = "10.1007/978-3-540-74208-1_15",

language = "English (US)",

isbn = "9783540742074",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "204--217",

booktitle = "Approximation, Randomization, and Combinatorial Optimization",

note = "10th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2007 and 11th International Workshop on Randomization and Computation, RANDOM 2007 ; Conference date: 20-08-2007 Through 22-08-2007",

}

TY - GEN

T1 - Approximation algorithms for the max-min allocation problem

AU - Khot, Subhash

AU - Ponnuswami, Ashok Kumar

PY - 2007

Y1 - 2007

N2 - 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 fc/a-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.

AB - 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 fc/a-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.

UR - http://www.scopus.com/inward/record.url?scp=38049084076&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=38049084076&partnerID=8YFLogxK

U2 - 10.1007/978-3-540-74208-1_15

DO - 10.1007/978-3-540-74208-1_15

M3 - Conference contribution

AN - SCOPUS:38049084076

SN - 9783540742074

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 204

EP - 217

BT - Approximation, Randomization, and Combinatorial Optimization

PB - Springer Verlag

T2 - 10th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2007 and 11th International Workshop on Randomization and Computation, RANDOM 2007

Y2 - 20 August 2007 through 22 August 2007

ER -

Approximation algorithms for the max-min allocation problem

Abstract

Publication series

Other

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this