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

谁在你的前三名?在有许多候选人的选举中优化学习

Who is in Your Top Three? Optimizing Learning in Elections with Many Candidates

Stanford University(斯坦福大学)

Nikhil Garg, Lodewijk Gelauff, Sukolsak Sakshuwong, Ashish Goel

摘要:

选举和民意调查通常有许多候选人,目的是根据选民的偏好对候选人进行排名或确定一小部分获胜者。在实践中,投票者不提供完整的排名;相反,每个投票者提供他们最喜欢的K个候选人,可能按排名顺序。选举组织者必须选择K和聚合规则。我们提供了一个理论框架来做出这些选择。每个K-认可或K-部分排名机制(具有相应的位置评分规则)都为选举正确恢复渐近结果的速度引入了学习率。给定选民的选择分布,选举规划者就可以确定速率最优机制。这一领域的早期工作提供了粗略的数量级不确定性,这不足以做出这样的选择。我们的框架进一步解决了多个机制之间的随机化何时可以改善学习的问题,对于任意的选民噪声模型。最后,我们使用的数据从5个大型参与式预算选举,我们组织了几个美国城市,以及其他排名数据,以证明我们的方法的实用性。特别是,我们发现,从历史上看,这样的选举设置K太低,选择正确的机制可以确定最终获胜者之间的差异只有80%的概率或99.9%的概率后,400名选民。

英文摘要:

Elections and opinion polls often have many candidates, with the aim to either rank the candidates or identify a small set of winners according to voters' preferences. In practice, voters do not provide a full ranking; instead, each voter provides their favorite K candidates, potentially in ranked order. The election organizer must choose K and an aggregation rule. We provide a theoretical framework to make these choices. Each K-Approval or K-partial ranking mechanism (with a corresponding positional scoring rule) induces a learning rate for the speed at which the election correctly recovers the asymptotic outcome. Given the voter choice distribution, the election planner can thus identify the rate optimal mechanism. Earlier work in this area provides coarse order-of-magnitude guaranties which are not sufficient to make such choices. Our framework further resolves questions of when randomizing between multiple mechanisms may improve learning, for arbitrary voter noise models. Finally, we use data from 5 large participatory budgeting elections that we organized across several US cities, along with other ranking data, to demonstrate the utility of our methods. In particular, we find that historically such elections have set K too low and that picking the right mechanism can be the difference between identifying the ultimate winner with only a 80% probability or a 99.9% probability after 400 voters.

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

↑