首页> 外文会议>Conference on Uncertainty in Artificial Intelligence >Electing the Most Probable Without Eliminating the Irrational: Voting Over Intransitive Domains
【24h】

Electing the Most Probable Without Eliminating the Irrational: Voting Over Intransitive Domains

机译:在不消除非理性的情况下选择最可能的:对不及物域的投票

获取原文

摘要

Picking the best alternative in a given set is a well-studied problem at the core of social choice theory. In some applications, one can assume that there is an objectively correct way to compare the alternatives, which, however, cannot be observed directly, and individuals' preferences over the alternatives (votes) are noisy estimates of this ground truth. The goal of voting in this case is to estimate the ground truth from the votes. In this paradigm, it is usually assumed that the ground truth is a ranking of the alternatives by their true quality. However, sometimes alternatives are compared using not one but multiple quality parameters, which may result in cycles in the ground truth as well as in the preferences of the individuals. Motivated by this, we provide a formal model of voting with possibly intransitive ground truth and preferences, and investigate the maximum likelihood approach for picking the best alternative in this case. We show that the resulting framework leads to polynomial-time algorithms, and also approximates the corresponding NP-hard problems in the classic framework.
机译:采摘给定集中的最佳替代方案是社会选择理论的核心学习问题。在一些应用中,人们可以假设有一种客观正确的方法来比较替代方案,然而,不能直接观察到的替代方案,而个人对替代方案(投票)的偏好是对此基础事实的嘈杂估计。在这种情况下投票的目标是从投票中估算地面真相。在这个范例中,通常认为地面事实是通过他们的真实质量来排名替代品。然而,有时使用不是一个但多种质量参数进行比较替代方案,这可能导致地面真理以及个人偏好中的循环。由此激励,我们提供了一个正式的表决模式,可能有可能不及物的原始和偏好,并调查在这种情况下选择最佳替代品的最大似然方法。我们表明所得到的框架导致多项式 - 时间算法,并且还近似于经典框架中的相应的NP难题。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号