On the configuration LP for maximum budgeted allocation
Name
10107_2015_928_ReferencePDF.pdf
Size
350.49 KB
Format
Adobe PDF
Checksum (MD5)
75a6a92ea2d617cefb42f5a92a299219
Author(s)
Kalaitzis, Christos
Madry, Aleksander
Newman, Alantha
Poláček, Lukáš
Svensson, Ola
Date Issued
July 2015
Journal
Mathematical Programming
Publisher
Springer Berlin Heidelberg
Citation
Kalaitzis, Christos, Aleksander Ma̧dry, Alantha Newman, Lukáš Poláček, and Ola Svensson. “On the Configuration LP for Maximum Budgeted Allocation.” Math. Program. 154, no. 1–2 (July 4, 2015): 427–462.
Version
Author's final manuscript
Abstract
We study the maximum budgeted allocation problem, i.e., the problem of selling a set of m indivisible goods to n players, each with a separate budget, such that we maximize the collected revenue. Since the natural assignment LP is known to have an integrality gap of 3[over]4, which matches the best known approximation algorithms, our main focus is to improve our understanding of the stronger configuration LP relaxation. In this direction, we prove that the integrality gap of the configuration LP is strictly better than 3[over]4, and provide corresponding polynomial time roundings, in the following restrictions of the problem: (i) the restricted budgeted allocation problem, in which all the players have the same budget and every item has the same value for any player it can be sold to, and (ii) the graph MBA problem, in which an item can be assigned to at most 2 players. Finally, we improve the best known upper bound on the integrality gap for the general case from 5[over]6 to 22√−2≈0.828 and also prove hardness of approximation results for both cases.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1007/s10107-015-0928-8
