Approximation algorithms for allocation problems: Improving the factor of 1 - 1/e

@article{Feige2006ApproximationAF,
title={Approximation algorithms for allocation problems: Improving the factor of 1 - 1/e},
author={Uriel Feige and Jan Vondr{\'a}k},
journal={2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06)},
year={2006},
pages={667-676}
}

Combinatorial allocation problems require allocating items to players in a way that maximizes the total utility. Two such problems received attention recently, and were addressed using the same linear programming (LP) relaxation. In the maximum submodular welfare (SMW) problem, utility functions of players are submodular, and for this case Dobzinski and Schapira [SODA 2006] showed an approximation ratio of 1 - 1/e. In the generalized assignment problem (GAP) utility functions are linear but… CONTINUE READING