Probabilistic Aspects of Voting, Intransitivity and Manipulation
英文摘要：
These lecture notes are based on lectures given in 2019 Saint-Flour Probability School.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
相关论文
The Probability of Intransitivity in Dice and Close Elections
We study the phenomenon of intransitivity in models of dice and voting. First, we follow a recent thread of research for $n$-sided dice with pairwise ordering induced by the probability, relative to $1/2$, that a throw from one die is higher than the other. We build on a recent result of Polymath showing that three dice with i.i.d. faces drawn from the uniform distribution on $\{1,\ldots,n\}$ and conditioned on the average of faces equal to $(n+1)/2$ are intransitive with asymptotic probability $1/4$. We show that if dice faces are drawn from a non-uniform continuous mean zero distribution con…
math.PR
Asymptotics of the minimum manipulating coalition size for positional voting rules under IC behaviour
We consider the problem of manipulation of elections using positional voting rules under Impartial Culture voter behaviour. We consider both the logical possibility of coalitional manipulation, and the number of voters that must be recruited to form a manipulating coalition. It is shown that the manipulation problem may be well approximated by a very simple linear program in two variables. This permits a comparative analysis of the asymptotic (large-population) manipulability of the various rules. It is seen that the manipulation resistance of positional rules with 5 or 6 (or more) candidates …
math.OCmath.PR
