具有平局投票的单峰模型
Modeling Single-Peakedness for Votes with Ties
摘要：
单峰性是对偏好的最重要和最知名的域限制之一。单峰选民的计算研究在很大程度上被限制在选举与领带自由的选票，和最近的工作，研究操纵攻击的计算复杂性的单峰选举与领带的选票已被限制在非标准模型的单峰偏好的最高订单。我们研究的计算复杂性的操纵选票的标准模型的单峰偏好和单平台的偏好。我们表明，这些模型避免了其他模型所表现出的异常复杂性行为。我们还指出了一个令人惊讶的结果之间的关系的社会轴和复杂的操纵单峰偏好。
英文摘要：
Single-peakedness is one of the most important and well-known domain restrictions on preferences. The computational study of single-peaked electorates has largely been restricted to elections with tie-free votes, and recent work that studies the computational complexity of manipulative attacks for single-peaked elections for votes with ties has been restricted to nonstandard models of single-peaked preferences for top orders. We study the computational complexity of manipulation for votes with ties for the standard model of single-peaked preferences and for single-plateaued preferences. We show that these models avoid the anomalous complexity behavior exhibited by the other models. We also state a surprising result on the relation between the societal axis and the complexity of manipulation for single-peaked preferences.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
