arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1403.7519cs.DS
收藏

关于最大分配的配置LP

On the Configuration LP for Maximum Budgeted Allocation

Christos Kalaitzis, Aleksander Mcadry, Alantha Newman, Lukáš Poláček, Ola Svensson

摘要:

我们研究了最大分配问题,即,将一组$m$不可分割的商品出售给$n$玩家的问题,每个玩家具有单独的预算,使得我们最大化所收集的收入。由于自然分配LP已知具有$\frac{3}{4}$的完整性间隙,这与最知名的近似算法相匹配,因此我们的主要重点是提高我们对更强配置LP松弛的理解。在这个方向上,我们证明了配置LP的完整性间隙严格优于$\frac{3}{4}$,并提供相应的多项式时间,在以下限制的问题:(i)限制性分配问题,其中所有玩家具有相同的预算,并且每个物品对于它可以出售给的任何玩家具有相同的价值,以及(ii)图MBA问题,其中一个物品可以被分配给最多2个玩家。最后,我们将一般情况下的完整性间隙的最佳已知上界从$\frac{5}{6}$改进为$2\sqrt{2}-2\approx 0.828$,并证明了这两种情况下近似结果的困难性。

英文摘要:

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 $\frac{3}{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 $\frac{3}{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 $\frac{5}{6}$ to $2\sqrt{2}-2\approx 0.828$ and also prove hardness of approximation results for both cases.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑