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

限制最大最小公平分配

Restricted Max-Min Fair Allocation

Siu-Wing Cheng, Yuchen Mao

摘要:

限制性最大最小公平分配问题寻求一种分配资源给参与者的方法,使任何参与者获得的最小总价值最大化。这是NP困难的近似问题的比例小于2。将用于估计最优值的当前最佳算法与用于构造分配的当前最佳算法进行比较,可以在多项式时间内实现的比率之间存在相当大的差距:用于估计的比率大约为4,用于构造的比率大约为$6 + 2\sqrt{10}$。我们提出了一种算法,构造一个分配的值在一个因素的$6 + δ$从最佳的任何常数$δ> 0$。对于所选的任何常量$δ$,运行时间与输入大小成多项式关系。

英文摘要:

The restricted max-min fair allocation problem seeks an allocation of resources to players that maximizes the minimum total value obtained by any player. It is NP-hard to approximate the problem to a ratio less than 2. Comparing the current best algorithm for estimating the optimal value with the current best for constructing an allocation, there is quite a gap between the ratios that can be achieved in polynomial time: roughly 4 for estimation and roughly $6 + 2\sqrt{10}$ for construction. We propose an algorithm that constructs an allocation with value within a factor of $6 + δ$ from the optimum for any constant $δ> 0$. The running time is polynomial in the input size for any constant $δ$ chosen.

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

↑