← Wonderland

Arrow's Impossibility Theorem

Kenneth Arrow proved, in his Columbia PhD thesis, that no voting rule can satisfy a short list of reasonable demands at once. The result quietly underwrites how we think about democracy.

Most paradoxes are amusing. A few are useful. Arrow's impossibility theorem is in the second category. It says, in essence, that the dream of a perfectly fair voting system is mathematically impossible. Not unlikely, not impractical — impossible. Once you write down a handful of properties you'd want any sensible group-decision rule to satisfy, you discover that every rule must violate at least one of them. The only escape is dictatorship.

The theorem was Kenneth Arrow's doctoral dissertation. He published it in 1951, at age 30, and was given the Nobel in Economics partly for it twenty-one years later. It is the founding result of social choice theory.

The problem of social choice

The setting is innocent enough. A group of people each have preferences over a set of options — candidates, policies, restaurants, anything. The group wants to combine those individual preferences into a single group ranking. The rule that does the combining is a social welfare function. Voting is the obvious example, but courts, committees, prediction markets, peer review, even algorithms that aggregate human feedback all face the same problem.

The naive instinct is that majority rule solves it. The Marquis de Condorcet noticed in 1785 that it does not. Take three voters and three options:

Voter 1 A B C Voter 2 B C A Voter 3 C A B each voter's ranking, top is most preferred A B C A > B 2 of 3 B > C 2 of 3 C > A 2 of 3

Condorcet's paradox. Each pairwise majority is decisive — yet the group as a whole prefers A to B, B to C, and C to A. A cycle, not a ranking.

Every pairwise majority is clear. Yet the group as a whole has no winner. Whichever option you pick, two-thirds of the room prefers something else. The individuals are rational about every pair; the collective is not. Arrow asked: is this a quirk of majority rule, or is something deeper going on?

The axioms

Arrow stripped the question down. Forget specific voting schemes. What minimal properties would any reasonable aggregation rule satisfy? He arrived at four.

Universal domain. The rule must produce an output for every possible profile of individual preferences. People are allowed to want what they want, in any order.

Pareto efficiency. If every individual strictly prefers X to Y, then the group must too. The least controversial requirement on the list.

Independence of irrelevant alternatives. Whether the group prefers X to Y should depend only on how individuals rank X against Y — not on anyone's feelings about some unrelated option Z. If we add a third candidate to a two-person race, the head-to-head ranking between the original two shouldn't flip.

Non-dictatorship. No single voter's preferences should fix the outcome regardless of what everyone else thinks.

These look like the floor of fairness, not the ceiling. Nothing here demands proportionality, secrecy, or equal weight. The theorem says even this floor is too high.

The theorem and why

Arrow's theorem: when there are three or more alternatives, no social welfare function can satisfy universal domain, Pareto, independence of irrelevant alternatives, and non-dictatorship at the same time. Any rule that satisfies the first three must be a dictatorship.

cannot all hold simultaneously Universal domain any preferences allowed Pareto unanimous wins are honoured Independence (IIA) no irrelevant alternative Non-dictatorship no single decider

Four mild-looking axioms. The theorem says you can keep any three, but never all four.

The argument runs through the idea of a decisive coalition: a set of voters whose unanimous preference for X over Y forces the group preference to match. Pareto guarantees that the set of all voters is decisive for every pair. Arrow showed that under IIA and universal domain, decisiveness contracts: any decisive coalition can be split, and one of the halves is still decisive on its own. Keep splitting; you end with a single voter who is decisive over every pair. That voter is the dictator. Each step is short. The conclusion is brutal.

“If we exclude the possibility of interpersonal comparisons of utility, then the only methods of passing from individual tastes to social preferences which will be satisfactory… are either imposed or dictatorial.”

It is worth pausing to notice what was assumed and what wasn't. Arrow worked with ordinal preferences only — rankings, not intensities. The voters can say A is better than B; they cannot say how much better. Every real voting system you've ever used takes only ordinal data: you tick a box, you list a ranking, you don't report a number. The theorem applies in full.

What it does and doesn't mean

The standard misreading is that Arrow refuted democracy. He did nothing of the kind. He proved that no rule can score perfectly on all four axes; he didn't prove that every rule fails badly. Real voting systems work by quietly trading one axiom for another. Plurality voting violates independence of irrelevant alternatives — the spoiler effect is exactly that violation. Instant-runoff voting violates it too, in subtler ways. Borda count likewise. Each is an engineering compromise, not a fraud.

Another way out is to weaken universal domain. If you assume voters' preferences are single-peaked — everyone disagrees along one underlying dimension and prefers options closer to their own ideal point — then majority rule produces a transitive group ranking and the median voter wins. This is Duncan Black's 1948 result. It rescues majority rule in a world where politics really is one-dimensional. The price is a strong assumption about what people are allowed to want.

You can also add cardinal information — let voters report intensities. Range voting and approval voting move in this direction. They sidestep Arrow but bump into Gibbard–Satterthwaite, a sibling impossibility theorem from the 1970s: any non-dictatorial voting rule with three or more options is open to strategic manipulation. Honest voting is not always the smart move. You can dodge one impossibility, but only by waking up another.

What Arrow really proved is that aggregation, as a general operation, is structurally hard. The hardness is not about politics or partisanship; it is about the mathematics of combining different orderings into one. The result generalises far beyond ballots. Whenever a committee combines reviewer scores, a jury produces a verdict, a search engine ranks pages by mixing signals, or a language model aggregates conflicting human feedback, the same shadow is in the room. There is always a trade. You can have something that looks fair locally and misbehaves globally, or something coherent globally that feels unfair locally. You cannot have both.

That is why Arrow's theorem keeps coming back. It is not really about voting. It is about the limits of any procedure that promises to turn a chorus of preferences into a single verdict. Arrow showed there is no such procedure that costs nothing. Knowing the bill in advance is what social choice theory has been about ever since.


Further reading

  1. Arrow, K. J. (1951; 2nd ed. 1963). Social Choice and Individual Values.
  2. Condorcet, M. de (1785). Essai sur l'application de l'analyse à la probabilité des décisions rendues à la pluralité des voix.
  3. Black, D. (1948). On the Rationale of Group Decision-Making. Journal of Political Economy.
  4. Sen, A. (1970). Collective Choice and Social Welfare.
  5. Gibbard, A. (1973). Manipulation of Voting Schemes: A General Result. Econometrica.