Common Voting Rules as Maximum Likelihood Estimators

07/04/2012
by   Vincent Conitzer, et al.
0

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

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/27/2017

Condorcet's Principle and the Preference Reversal Paradox

We prove that every Condorcet-consistent voting rule can be manipulated ...
research
12/13/2021

Robust Voting Rules from Algorithmic Robust Statistics

In this work we study the problem of robustly learning a Mallows model. ...
research
01/14/2023

Robust Remote Sensing Scene Classification with Multi-View Voting and Entropy Ranking

Deep convolutional neural networks have been widely used in scene classi...
research
10/16/2012

A Maximum Likelihood Approach For Selecting Sets of Alternatives

We consider the problem of selecting a subset of alternatives given nois...
research
11/08/2018

Incentivising Participation in Liquid Democracy with Breadth First Delegation

Liquid democracy allows an agent to either vote directly over the availa...
research
09/18/2019

Voting with Random Classifiers (VORACE)

In many machine learning scenarios, looking for the best classifier that...
research
09/05/2023

Aggregating Correlated Estimations with (Almost) no Training

Many decision problems cannot be solved exactly and use several estimati...

Please sign up or login with your details

Forgot password? Click here to reset