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 MarketsSocial 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 ZeroThe Number ZeroCounting to FiveCounting to 10Counting to 20Counting a Set of Objects Up to 20Cardinality: The Last Number CountedMatching Numerals to QuantitiesSubitizing Small QuantitiesAddition Within 10Number Bonds to 10Addition Within 20Doubles and Near DoublesDoubles Facts Within 10Near Doubles Facts Within 20Mental Math Strategies for AdditionMental Math: Adding and Subtracting TensAddition Within 100Repeated Addition as MultiplicationMultiplication as Equal GroupsMultiplication: ArraysBasic Multiplication Facts (0s, 1s, 2s, 5s, 10s)Multiplication Facts Within 100Division as Equal SharingDivision as Grouping (Measurement Division)Division: Grouping (Repeated Subtraction) ModelDivision: Fair Sharing ModelDivision as Equal SharingDivision as GroupingBasic Division FactsDivision Facts Within 100Multiplication and Division Fact FamiliesRelationship Between Multiplication and DivisionDivision Facts as Inverse of MultiplicationRemainders and Quotients in DivisionDivision Word ProblemsMulti-Step Word ProblemsSolving Multi-Step Word ProblemsMultiplication Word ProblemsDivision Word ProblemsIntroduction to Long DivisionFactors and MultiplesPrime and Composite NumbersEquivalent FractionsRelating Fractions and DecimalsDecimal Place ValueIntegers and the Number LineComparing and Ordering IntegersAbsolute ValueAdding IntegersSubtracting IntegersMultiplying IntegersDividing IntegersUnit RatesProportionsPercent ConceptConverting Between Fractions, Decimals, and PercentsOperations with Rational NumbersTwo-Step EquationsSolving Multi-Step EquationsEquations with Variables on Both SidesLiteral EquationsSlope-Intercept FormPoint-Slope FormWriting Linear EquationsParallel and Perpendicular Line SlopesGraphing Linear EquationsPiecewise FunctionsOne-Sided LimitsContinuity DefinitionLimits and Continuity in Multiple VariablesFunctions of Several VariablesContinuity in Multiple VariablesPartial Derivatives: Definition and ComputationDifferentiability in Multiple VariablesDifferentiability in Multivariable FunctionsTotal Differential and Linear ApproximationChain Rule for Multivariable FunctionsImplicit DifferentiationRelated RatesOptimization ProblemsCritical Points of Multivariable FunctionsCritical Points and Classification of ExtremaSecond Partial Test for Local Extrema (Hessian)The Hessian Matrix and Second Derivative TestUnconstrained Optimization: Finding ExtremaOptimization in Multiple VariablesLagrange MultipliersConstrained Optimization and Lagrange MultipliersUtility and PreferencesMarginal Utility and Diminishing ReturnsProfit MaximizationPerfect CompetitionShutdown and Breakeven DecisionsMonopolyMonopolistic CompetitionOligopoly and Strategic BehaviorGame Theory BasicsNash EquilibriumNash Equilibrium RefinementsStrategic Form Games and Nash EquilibriumExtensive Form Games and Game TreesSubgame Perfect EquilibriumPerfect Bayesian EquilibriumPooling and Separating EquilibriaAdverse Selection and Screening MechanismsInsurance Markets with Adverse SelectionAdverse SelectionInformation Asymmetry in MarketsArrow's Impossibility Theorem and Social Choice

Longest path: 110 steps · 573 total prerequisite topics

Prerequisites (1)

Leads To (1)