Common Voting Rules as Maximum Likelihood Estimators
classification
💻 cs.GT
cs.AI
keywords
votingrankingalternativescorrectoutcomevotevoteraggregation
read the original abstract
Voting is a very general method of preference aggregation. A voting rule takes as input every voter's vote (typically, a ranking of the alternatives), and produces as output either just the winning alternative or a ranking of the alternatives. One potential view of voting is the following. There exists a 'correct' outcome (winner/ranking), and each voter's vote corresponds to a noisy perception of this correct outcome. If we are given the noise model, then for any vector of votes, we can
This paper has not been read by Pith yet.
Forward citations
Cited by 1 Pith paper
-
Optimal Posterior E-values with Non-Convex Parameter Sets with Applications to Voting Systems
A framework for optimal posterior e-values with non-convex composite hypotheses, demonstrated via statistical tests for multiple voting systems including the first treatment of Schulze.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.