arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2404.07707cs.GT
收藏

面向带补贴的加权比例分配的基于树分裂的舍入方案

Tree Splitting Based Rounding Scheme for Weighted Proportional Allocations with Subsidy

Xiaowei Wu, Shengwei Zhou

AI总结:

针对带补贴的加权不可分割物品比例分配问题,通过将分数投标-获取算法的分配结果构造为有向树并分裂为规范分量,提出了总补贴至多为$n/3-1/6$的舍入方案,改进了已有结果。

摘要:

我们研究将$m$个不可分割物品分配给$n$个异质智能体的问题,目标是通过引入补贴(资金)计算出比例分配结果。Wu等人(WINE 2023)已证明,当智能体无权重时,总补贴为$n/4$(假设每个物品对每个智能体的价值/成本至多为$1$)足以保证比例性。当智能体具有通用权重时,他们提出了一种算法,通过对分数投标-获取算法进行舍入,可保证加权比例分配,所需总补贴为$(n-1)/2$。在本研究中,我们重新探讨了该问题及分数投标-获取算法。我们证明,通过将该算法返回的分数分配表述为连接各智能体的有向树,并将树分裂为规范分量,可得到一种舍入方案,其所需总补贴至多为$n/3 - 1/6$。

英文摘要:

We consider the problem of allocating $m$ indivisible items to a set of $n$ heterogeneous agents, aiming at computing a proportional allocation by introducing subsidy (money). It has been shown by Wu et al. (WINE 2023) that when agents are unweighted a total subsidy of $n/4$ suffices (assuming that each item has value/cost at most $1$ to every agent) to ensure proportionality. When agents have general weights, they proposed an algorithm that guarantees a weighted proportional allocation requiring a total subsidy of $(n-1)/2$, by rounding the fractional bid-and-take algorithm. In this work, we revisit the problem and the fractional bid-and-take algorithm. We show that by formulating the fractional allocation returned by the algorithm as a directed tree connecting the agents and splitting the tree into canonical components, there is a rounding scheme that requires a total subsidy of at most $n/3 - 1/6$.

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

↑