A phase transition in Arrow’s theorem with three alternatives

Arrow’s theorem concerns a fundamental problem in social choice theory: given the individual preferences of members of a group, how can they be aggregated to form rational group preferences? Arrow showed that in an election between three or more candidates, there are situations where any voting rule satisfying a small list of natural “fairness” axioms must produce an apparently irrational intransitive outcome. Furthermore, quantitative versions of Arrow’s theorem in the literature show that when voters choose rankings in an i.i.d. fashion, the outcome is intransitive with nonnegligible probability. It is natural to ask if such a quantitative version of Arrow’s theorem holds for non-i.i.d. models. To answer this question, we study Arrow’s theorem under a natural non-i.i.d. model of voters inspired by canonical models in statistical physics; indeed, a version of this model was previously introduced by Raffaelli and Marsili in the physics literature. This model has a parameter, temperature, that prescribes the correlation between different voters. We show that the behavior of Arrow’s theorem in this model of an election with three alternatives undergoes a striking phase transition: in the entire high temperature regime of the model, a quantitative Arrow’s theorem holds showing that the probability of paradox for any voting rule satisfying the axioms is nonnegligible; this is tight because the probability of paradox under pairwise majority goes to zero when approaching the critical temperature, and becomes exponentially small in the number of voters beyond it. We prove this occurs in another natural model of correlated voters and conjecture this phenomena is quite general.

Authors

Institutions

Publication Details

Journal
The Annals of Applied Probability
Published
2024-08-01
DOI
https://doi.org/10.1214/24-aap2049
Primary Topic
Game Theory and Voting Systems
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A phase transition in Arrow’s theorem with three alternatives

Frederic Koehler, Elchanan Mossel
The Annals of Applied Probability
Game Theory and Voting Systems
article

A phase transition in Arrow’s theorem with three alternatives

Frederic Koehler, Elchanan Mossel
article en

Abstract

Arrow’s theorem concerns a fundamental problem in social choice theory: given the individual preferences of members of a group, how can they be aggregated to form rational group preferences? Arrow showed that in an election between three or more candidates, there are situations where any voting rule satisfying a small list of natural “fairness” axioms must produce an apparently irrational intransitive outcome. Furthermore, quantitative versions of Arrow’s theorem in the literature show that when voters choose rankings in an i.i.d. fashion, the outcome is intransitive with nonnegligible probability. It is natural to ask if such a quantitative version of Arrow’s theorem holds for non-i.i.d. models. To answer this question, we study Arrow’s theorem under a natural non-i.i.d. model of voters inspired by canonical models in statistical physics; indeed, a version of this model was previously introduced by Raffaelli and Marsili in the physics literature. This model has a parameter, temperature, that prescribes the correlation between different voters. We show that the behavior of Arrow’s theorem in this model of an election with three alternatives undergoes a striking phase transition: in the entire high temperature regime of the model, a quantitative Arrow’s theorem holds showing that the probability of paradox for any voting rule satisfying the axioms is nonnegligible; this is tight because the probability of paradox under pairwise majority goes to zero when approaching the critical temperature, and becomes exponentially small in the number of voters beyond it. We prove this occurs in another natural model of correlated voters and conjecture this phenomena is quite general.

The Annals of Applied ProbabilityVol. 34(4)
University of Chicago (US), Massachusetts Institute of Technology (US)
Openalex Percentile: Top 84%
Game Theory and Voting Systems
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.