论文标题
计算社会选择中的优先限制：调查
Preference Restrictions in Computational Social Choice: A Survey
论文作者
论文摘要
在受限的偏好领域（例如单峰，单跨和欧几里得偏好）上，社会选择变得更加容易。许多不可能的定理消失了，结构使人们更容易理解偏好，并且可以更有效地解决计算问题。在这项调查中，我们详细概述了许多经典和现代的限制性偏好域，并探索其属性和应用。我们从计算社会选择的角度来做到这一点，让计算问题推动了我们的兴趣，但我们还对经济学和社会选择文献进行了全面讨论。我们调查的特定重点领域包括算法，以认识到偏好是否属于特定的偏好领域，以及赢家确定投票规则的算法，如果偏好不受限制，这些投票规则很难计算。
Social choice becomes easier on restricted preference domains such as single-peaked, single-crossing, and Euclidean preferences. Many impossibility theorems disappear, the structure makes it easier to reason about preferences, and computational problems can be solved more efficiently. In this survey, we give a thorough overview of many classic and modern restricted preference domains and explore their properties and applications. We do this from the viewpoint of computational social choice, letting computational problems drive our interest, but we include a comprehensive discussion of the economics and social choice literatures as well. Particular focus areas of our survey include algorithms for recognizing whether preferences belong to a particular preference domain, and algorithms for winner determination of voting rules that are hard to compute if preferences are unrestricted.
