arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2111.08698cs.GTcs.DS
收藏

关于随机度量失真猜想

On the Randomized Metric Distortion Conjecture

Haripriya Pulyassary, Chaitanya Swamy

摘要:

在单个获胜者确定问题中,我们有n个选民和m个候选人,如果候选人i被选中,每个选民j都会产生成本c(i,j)。我们的目标是选择一个候选人,最大限度地减少选民的预期总成本;然而,由于我们只能获得代理人对结果的偏好排名,效率损失是不可避免的。这种效率损失通过失真来量化。我们给出了一个度量单一赢家确定问题的实例,其中任何随机社会选择函数的失真至少为2.063164。这推翻了长期存在的猜想,即存在一个随机社会选择函数,其最坏情况下的失真最多为2。

英文摘要:

In the single winner determination problem, we have n voters and m candidates and each voter j incurs a cost c(i, j) if candidate i is chosen. Our objective is to choose a candidate that minimizes the expected total cost incurred by the voters; however as we only have access to the agents' preference rankings over the outcomes, a loss of efficiency is inevitable. This loss of efficiency is quantified by distortion. We give an instance of the metric single winner determination problem for which any randomized social choice function has distortion at least 2.063164. This disproves the long-standing conjecture that there exists a randomized social choice function that has a worst-case distortion of at most 2.

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

↑