Equitable, neutral, and efficient voting rules

In the context of voting, Moulin (1980) establishes that anonymity, neutrality, and efficiency are often incompatible unless one accepts indecision (i.e. ties). We show that versions of this incompatibility continue to hold for a natural weakening of anonymity proposed by Bartholdi et al. (2021) called equity . As equity is a relatively weak fairness requirement, the tension between fairness and efficiency in voting is deeper than previously established.

Authors

Institutions

Publication Details

Journal
Journal of Mathematical Economics
Published
2024-09-28
DOI
https://doi.org/10.1016/j.jmateco.2024.103061
Citations
3
Primary Topic
Game Theory and Voting Systems
Type
article
Field-Weighted Citation Impact
3.39
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Equitable, neutral, and efficient voting rules

Steven Kivinen
3 citations
Journal of Mathematical Economics
Game Theory and Voting Systems
3.39
article

Equitable, neutral, and efficient voting rules

Steven Kivinen
article en
3 citations

Abstract

In the context of voting, Moulin (1980) establishes that anonymity, neutrality, and efficiency are often incompatible unless one accepts indecision (i.e. ties). We show that versions of this incompatibility continue to hold for a natural weakening of anonymity proposed by Bartholdi et al. (2021) called equity . As equity is a relatively weak fairness requirement, the tension between fairness and efficiency in voting is deeper than previously established.

Journal of Mathematical EconomicsVol. 115
University of Graz (AT)
Openalex Percentile: Top 6%
Game Theory and Voting Systems
3.39
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.