MODELS
← Browse the encyclopedia

Encyclopedia · Free preview

Arrow’s Impossibility Theorem

Kenneth Arrow's mathematical proof that no voting system can simultaneously satisfy all fairness criteria for aggregating individual preferences into group decisions when there are three or more options. Specifically: no system can be non-dictatorial, Pareto efficient, and independent of irrelevant alternatives simultaneously. The profound implication: there is no 'fair' way to aggregate diverse preferences into a collective decision—every voting system makes trade-offs that can produce paradoxical or unfair outcomes. This isn't a design flaw to be fixed; it's a mathematical impossibility.

When to use it

When designing governance structures, voting systems, or group decision processes; when a group decision seems 'unfair' despite following an agreed-upon process; when multiple valid options compete and no aggregation method seems satisfactory; when evaluating democratic processes and understanding their inherent limitations.

How it can help

Stop searching for the 'perfect' decision-making process—Arrow proved it doesn't exist. Instead, choose the process whose trade-offs are most acceptable for your context. Majority voting is simple but can cycle (A beats B, B beats C, C beats A). Ranked choice reduces strategic voting but is complex. Consensus avoids tyranny of the majority but gives veto power to holdouts. Understanding Arrow's theorem means accepting these trade-offs consciously rather than assuming your chosen method is 'fair' and being surprised when paradoxes appear.

Keep exploring

Read the full page.

Create your free access to continue reading and explore the complete library.

Register free with ChatGPT →

Already registered? Use the same button to sign in.

Sign-in shares your email with Michael Simmons to create your site access. No payment required. Newsletter signup is separate. How your data is used