Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
97 tokens/sec
GPT-4o
11 tokens/sec
Gemini 2.5 Pro Pro
47 tokens/sec
o3 Pro
5 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Common Voting Rules as Maximum Likelihood Estimators (1207.1368v1)

Published 4 Jul 2012 in cs.GT and cs.AI

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

Citations (182)

Summary

An Analysis of "Common Voting Rules as Maximum Likelihood Estimators"

This paper presents an exploration into interpreting common voting rules through the lens of maximum likelihood estimation (MLE) in the context of noisy perceptions of a "correct" outcome. Written by Vincent Conitzer and Tuomas Sandholm, the paper aims to address the extent to which various traditional voting rules can be aligned with MLE principles, assuming a noise model where voter preferences are independent given the correct outcome.

The authors propose two perspectives on voting: one where voters' preferences are idiosyncratic and serve to find a compromise maximizing collective welfare, and another where voters' preferences are noisy approximations of an absolute candidate quality. The paper focuses on the latter, using statistical reasoning to map voting rules onto MLE frameworks.

The central research question is whether existing voting rules can be considered MLEs of correct outcomes under certain probabilistic noise models. Such alignment implies that these rules would naturally aggregate information, thus potentially guiding the choice of voting systems in practice.

Key Findings

  1. Scoring Rules: The paper establishes that scoring rules, including well-known methods such as plurality, Borda, and veto, can be interpreted as both MLE for choosing a winner (MLEWIV) and for ranking candidates (MLERIV). This is achieved by constructing specific noise models where voter rankings of candidates are informed by their perceived correctness, hence resulting in scores matching with the point-based structure of scoring rules.
  2. Single Transferable Vote (STV): The STV rule was shown to fit the MLERIV category but not MLEWIV. Through rigorous structural analysis of how votes transfer based on current standing, the authors effectively demonstrated that while STV can order candidates under a noise model, it does not meet the criteria for winner identification based on MLE.
  3. Impossibilities for Certain Rules: Several common rules, including Bucklin, Copeland, maximin, and ranked pairs, were argued not to be interpretable as MLEs under independent voter-generated noise models. Through a combinatorial analysis of voting scenarios, it was shown that these rules fail to satisfy the consistency required by MLE across different vote distributions.

The paper provides substantial theoretical contributions by formalizing which voting methods naturally extend from probabilistic views of committee decisions. Its granular analysis of voting procedures, both achievable and not achievable, underlines potential shortcomings in traditional systems when viewed through this statistical lens.

Implications and Future Directions

The theoretical framework proposed invites a reevaluation of the applicability and theoretical underpinnings of various voting rules. It presents an opportunity to reconfigure or innovate voting systems to better capture voters' intents as noisy signals within the described formal mathematical constraints.

For future research, the paper leaves pertinent inquiries open:

  • The improvement of noise models for scoring and other validated rules to better align with practical applications.
  • Exploration of rules that are inherently not explainable through current noise models and examining whether this is due to mathematical or philosophical limitations.
  • Evaluation of how relaxing independence assumptions among votes might alter rule classifications.

Overall, the paper's approach could influence both the application of voting rules in real-world settings and inspire novel structures in voting mechanisms that are statistically coherent. The paper's synthesizing of voting theory with statistical estimation provides actionable insights that could inform AI-driven decision-making systems and enhance collaborative environments across various fields.