politicsWikipedia1951
No ranked voting system can meet every ideal criterion once there are three or more choices
Kenneth Arrow proved in 1951 that when there are more than two options, no ranked voting method can satisfy all the properties we would want from a fair group decision. One key property is independence of irrelevant alternatives: whether A beats B should not depend on some unrelated option C. The Marquis de Condorcet had earlier shown that majority rule can produce cycles, where A beats B, B beats C and C beats A. Arrow generalised that problem to every ranked system, including oligarchies and consensus procedures.
Ranked ballots only record which option each voter prefers to which. When three or more options are involved, these pairwise preferences can form loops, so no rule that turns them into one winner can also meet every fairness condition.
The theorem explains why spoiler candidates appear in ranked elections no matter how the ballot is designed, so every voting system involves trade-offs. Arrow later conceded that rated systems, where voters give each candidate a separate score, escape his result because they use more information than rankings do. That is why score and approval voting are often discussed as alternatives.
The same tension appears in Condorcet's 18th-century voting paradox, which Arrow generalised, and in modern debates over instant-runoff voting, where a candidate can lose after being ranked first by more voters. Each reform trades one desirable property for another.
From Wikipedia, the free encyclopedia · text CC BY-SA 4.0
Illustrative photo · Tomas McIntee, Public domain, via Wikimedia Commons
