Noisy sorting without resampling
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Generalized scoring rules and the frequency of coalitional manipulability
Proceedings of the 9th ACM conference on Electronic commerce
On distance rationalizability of some voting rules
Proceedings of the 12th Conference on Theoretical Aspects of Rationality and Knowledge
On the role of distances in defining voting rules
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
Ties matter: complexity of voting manipulation revisited
The 10th International Conference on Autonomous Agents and Multiagent Systems - Volume 1
Voting with limited information and many alternatives
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Optimal social choice functions: a utilitarian view
Proceedings of the 13th ACM Conference on Electronic Commerce
A maximum likelihood approach towards aggregating partial orders
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One
Manipulation under voting rule uncertainty
Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems - Volume 2
| Hi-index | 0.00 |
A well-studied approach to the design of voting rules views them as maximum likelihood estimators; given votes that are seen as noisy estimates of a true ranking of the alternatives, the rule must reconstruct the most likely true ranking. We argue that this is too stringent a requirement, and instead ask: How many votes does a voting rule need to reconstruct the true ranking? We define the family of pairwise-majority consistent rules, and show that for all rules in this family the number of samples required from the Mallows noise model is logarithmic in the number of alternatives, and that no rule can do asymptotically better (while some rules like plurality do much worse). Taking a more normative point of view, we consider voting rules that surely return the true ranking as the number of samples tends to infinity (we call this property accuracy in the limit); this allows us to move to a higher level of abstraction. We study families of noise models that are parametrized by distance functions, and find voting rules that are accurate in the limit for all noise models in such general families. We characterize the distance functions that induce noise models for which pairwise-majority consistent rules are accurate in the limit, and provide a similar result for another novel family of position-dominance consistent rules. These characterizations capture three well-known distance functions.