The Smoothed Satisfaction of Voting Axioms

06/03/2021 ∙ by Lirong Xia, et al. ∙ 0

We initiate the work towards a comprehensive picture of the smoothed satisfaction of voting axioms, to provide a finer and more realistic foundation for comparing voting rules. We adopt the smoothed social choice framework, where an adversary chooses arbitrarily correlated "ground truth" preferences for the agents, on top of which random noises are added. We focus on characterizing the smoothed satisfaction of two well-studied voting axioms: Condorcet criterion and participation. We prove that for any fixed number of alternatives, when the number of voters n is sufficiently large, the smoothed satisfaction of the Condorcet criterion under a wide range of voting rules is 1, 1-exp(-Θ(n)), Θ(n^-0.5), exp(-Θ(n)), or being Θ(1) and 1-Θ(1) at the same time; and the smoothed satisfaction of participation is 1-Θ(n^-0.5). Our results address open questions by Berg and Lepelley in 1994 for these rules, and also confirm the following high-level message: the Condorcet criterion is a bigger concern than participation under realistic models.



There are no comments yet.


page 17

page 19

This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.