A topic in the Open Knowledge Graph — a free, open map of 15,290 topics and the order to learn them in.

Arrow's Impossibility Theorem and Social Choice

Research Depth 109 in the knowledge graph ☐ I know this ☆ Set as goal
1topic build on this
573prerequisites beneath it
See this on the map →
Information Asymmetry in Markets→→Social Welfare Maximization and Optimal Taxation
social-choice voting

Core Idea

Arrow's Impossibility Theorem shows that no voting rule simultaneously satisfies: unrestricted domain (any preference profile), unanimity (if all prefer A to B, society does), independence of irrelevant alternatives (society's A vs. B ranking depends only on voters' relative preferences), and non-dictatorship (no single voter dictates). This fundamental result reveals unavoidable tradeoffs in aggregating preferences into collective decisions.

Explainer

Suppose a group of friends needs to rank three restaurants for dinner. Each person has their own preference ordering. You want a rule that takes everyone's individual rankings and produces a single group ranking. This sounds straightforward — majority rule works fine with two options. But Arrow's theorem says that with three or more alternatives, no rule can satisfy a small set of seemingly reasonable fairness conditions simultaneously. The result is not about any particular voting system being flawed; it is about all possible systems being flawed in at least one way.

The four conditions Arrow requires each seem individually uncontroversial. Unrestricted domain means the rule must work for any combination of individual preferences — you cannot assume people's tastes are conveniently aligned. Unanimity (also called the Pareto condition) says that if literally every voter prefers A to B, the group ranking should place A above B. Independence of irrelevant alternatives (IIA) says that the group's ranking of A versus B should depend only on how individuals rank A versus B — not on how they feel about some third option C. Non-dictatorship says no single individual always gets their way regardless of what everyone else wants. Each condition seems like a minimal requirement for a fair system, yet Arrow proved they are collectively incompatible.

The proof works by showing that the conditions, taken together, force an escalating concentration of power. Start with any group of voters that is "decisive" over some pair of alternatives — meaning their preferences determine the group ranking for that pair. IIA and unanimity together imply that this decisive group must also be decisive over every other pair. Then you can show that any decisive group can be split into smaller decisive subgroups, and this process continues until you reach a single individual who is decisive over all pairs — a dictator. The logic is inescapable: the axioms themselves generate the dictatorship.

The practical impact is profound for institutional design. Every real voting system — plurality rule, ranked-choice voting, Borda counts, approval voting — violates at least one of Arrow's conditions. Plurality and ranked-choice violate IIA: adding a third candidate can change the relative ranking of the original two (this is the "spoiler effect" familiar from elections). Borda counts also violate IIA. Dictatorship satisfies the other three conditions trivially but violates non-dictatorship. Understanding which condition each system sacrifices is essential for evaluating democratic institutions, committee decision-making, and any setting where individual preferences must be aggregated into a collective choice. Arrow's theorem does not say democracy is impossible — it says that every democratic system involves an unavoidable compromise, and the question is which compromise you are willing to accept.

Practice Questions 5 questions

Prerequisite Chain

Understanding Zero → The Number Zero → Counting to Five → Counting to 10 → Counting to 20 → Counting a Set of Objects Up to 20 → Cardinality: The Last Number Counted → Matching Numerals to Quantities → Subitizing Small Quantities → Addition Within 10 → Number Bonds to 10 → Addition Within 20 → Doubles and Near Doubles → Doubles Facts Within 10 → Near Doubles Facts Within 20 → Mental Math Strategies for Addition → Mental Math: Adding and Subtracting Tens → Addition Within 100 → Repeated Addition as Multiplication → Multiplication as Equal Groups → Multiplication: Arrays → Basic Multiplication Facts (0s, 1s, 2s, 5s, 10s) → Multiplication Facts Within 100 → Division as Equal Sharing → Division as Grouping (Measurement Division) → Division: Grouping (Repeated Subtraction) Model → Division: Fair Sharing Model → Division as Equal Sharing → Division as Grouping → Basic Division Facts → Division Facts Within 100 → Multiplication and Division Fact Families → Relationship Between Multiplication and Division → Division Facts as Inverse of Multiplication → Remainders and Quotients in Division → Division Word Problems → Multi-Step Word Problems → Solving Multi-Step Word Problems → Multiplication Word Problems → Division Word Problems → Introduction to Long Division → Factors and Multiples → Prime and Composite Numbers → Equivalent Fractions → Relating Fractions and Decimals → Decimal Place Value → Integers and the Number Line → Comparing and Ordering Integers → Absolute Value → Adding Integers → Subtracting Integers → Multiplying Integers → Dividing Integers → Unit Rates → Proportions → Percent Concept → Converting Between Fractions, Decimals, and Percents → Operations with Rational Numbers → Two-Step Equations → Solving Multi-Step Equations → Equations with Variables on Both Sides → Literal Equations → Slope-Intercept Form → Point-Slope Form → Writing Linear Equations → Parallel and Perpendicular Line Slopes → Graphing Linear Equations → Piecewise Functions → One-Sided Limits → Continuity Definition → Limits and Continuity in Multiple Variables → Functions of Several Variables → Continuity in Multiple Variables → Partial Derivatives: Definition and Computation → Differentiability in Multiple Variables → Differentiability in Multivariable Functions → Total Differential and Linear Approximation → Chain Rule for Multivariable Functions → Implicit Differentiation → Related Rates → Optimization Problems → Critical Points of Multivariable Functions → Critical Points and Classification of Extrema → Second Partial Test for Local Extrema (Hessian) → The Hessian Matrix and Second Derivative Test → Unconstrained Optimization: Finding Extrema → Optimization in Multiple Variables → Lagrange Multipliers → Constrained Optimization and Lagrange Multipliers → Utility and Preferences → Marginal Utility and Diminishing Returns → Profit Maximization → Perfect Competition → Shutdown and Breakeven Decisions → Monopoly → Monopolistic Competition → Oligopoly and Strategic Behavior → Game Theory Basics → Nash Equilibrium → Nash Equilibrium Refinements → Strategic Form Games and Nash Equilibrium → Extensive Form Games and Game Trees → Subgame Perfect Equilibrium → Perfect Bayesian Equilibrium → Pooling and Separating Equilibria → Adverse Selection and Screening Mechanisms → Insurance Markets with Adverse Selection → Adverse Selection → Information Asymmetry in Markets → Arrow's Impossibility Theorem and Social Choice

Longest path: 110 steps · 573 total prerequisite topics

Prerequisites (1)

Leads To (1)