arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1906.00182cs.GTcs.AIcs.MA
收藏

具有独立偏好的指派问题的平均情形分析

Average-case Analysis of the Assignment Problem with Independent Preferences

University of Pennsylvania(宾夕法尼亚大学);University of Southampton(南安普顿大学)

Yansong Gao, Jie Zhang

摘要:

基本的分配问题是在寻找福利最大化的机制,分配项目的代理人时,私人偏好不可分割的项目是由自利代理。主流机制\textit{Random Priority}是渐进的最佳机制,为此目的,当比较其福利的最佳社会福利使用规范\textit{worst-case approximation ratio}。尽管它很受欢迎,但由最坏情况比率表示的效率损失并没有恒定的界限。最近,[Deng,Gao,Zhang 2017]表明,当代理人的偏好来自均匀分布时,其\textit{average-case approximation ratio}的上限为3.718。他们留下了一个悬而未决的问题,即恒定的比率是否适用于一般情况。在本文中,我们提供了一个肯定的答案,这个问题表明,该比率是有界的$1/μ$时,偏好值是独立和同分布的随机变量,其中$μ$是值分布的期望。这个上限也改进了[Deng,Gao,Zhang 2017]中均匀分布的上限3.718。此外,在温和的条件下,该比率对任何独立的随机值都有一个\textit{constant}界。在获得这些结果的过程中,我们开发了强大的工具来展示在大多数情况下效率损失很小的见解。

英文摘要:

The fundamental assignment problem is in search of welfare maximization mechanisms to allocate items to agents when the private preferences over indivisible items are provided by self-interested agents. The mainstream mechanism \textit{Random Priority} is asymptotically the best mechanism for this purpose, when comparing its welfare to the optimal social welfare using the canonical \textit{worst-case approximation ratio}. Despite its popularity, the efficiency loss indicated by the worst-case ratio does not have a constant bound. Recently, [Deng, Gao, Zhang 2017] show that when the agents' preferences are drawn from a uniform distribution, its \textit{average-case approximation ratio} is upper bounded by 3.718. They left it as an open question of whether a constant ratio holds for general scenarios. In this paper, we offer an affirmative answer to this question by showing that the ratio is bounded by $1/μ$ when the preference values are independent and identically distributed random variables, where $μ$ is the expectation of the value distribution. This upper bound also improves the upper bound of 3.718 in [Deng, Gao, Zhang 2017] for the Uniform distribution. Moreover, under mild conditions, the ratio has a \textit{constant} bound for any independent random values. En route to these results, we develop powerful tools to show the insights that in most instances the efficiency loss is small.

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

↑