Social choice theory

Arrow's impossibility theorem, explained for group decisions

Arrow's impossibility theorem shows that no ranked preference aggregation rule can satisfy a set of attractive fairness conditions in every case. It warns against magical thinking about voting systems without proving that collective decisions are hopeless.

Start a decision See the mechanism

Nicolas mechanism signals

These concepts follow the mathematical contract used by the app.

Convex cost

cost = c * sum a_ij^2

Voice budget

sum a_ij^2 <= B

Outcome rule

shifted softmax over support

What the theorem says

In settings with at least three alternatives, Arrow's theorem studies rules that convert individual rankings into a collective ranking.

Under unrestricted preferences, Pareto efficiency, independence of irrelevant alternatives, and non-dictatorship, the theorem says no such rule can satisfy all of those conditions at once.

What problem it exposes

The theorem exposes a structural limit of ordinal aggregation because a ranked ballot says what comes before what, but not how intensely a voter cares about the difference.

That limit does not make democracy incoherent. It means every decision rule makes tradeoffs, and those tradeoffs need to be explicit.

Where Nicolas fits

Nicolas does not turn individual rankings into a social ranking. It asks for costly support and opposition intensities under a finite voice budget.

That moves the decision into a different information model. It is a practical way to measure strength of preference when intensity matters, not a universal escape from impossibility.

Use cases

Where this decision model helps

Ordinal limits

Understand why ranked preference aggregation cannot satisfy every attractive condition.

Mechanism transparency

Use the theorem as a reason to state a decision rule's assumptions.

Intensity-aware alternatives

See why Nicolas asks how strongly people care rather than only how they rank options.

FAQ

Does Arrow's theorem apply to quadratic voting?

Arrow's theorem is about aggregating ordinal rankings into a social ordering, while quadratic voting's costly intensity inputs are a different formal object.

Does Arrow's theorem prove democracy is impossible?

No. It proves that ordinal aggregation rules cannot guarantee a specific set of fairness conditions under unrestricted preferences.

Why do product teams care?

It shows why voting tools need to state what information they collect and what tradeoffs their aggregation rule makes.

Keep reading

Continue with adjacent concepts and practical Nicolas workflows.

Quadratic votingLearn the intensity-aware voting model Nicolas implements.Gibbard-Satterthwaite theoremLearn why strategyproof voting rules are hard to design.

What the theorem says

In settings with at least three alternatives, Arrow's theorem studies rules that convert individual rankings into a collective ranking.

Under unrestricted preferences, Pareto efficiency, independence of irrelevant alternatives, and non-dictatorship, the theorem says no such rule can satisfy all of those conditions at once.

What problem it exposes

The theorem exposes a structural limit of ordinal aggregation because a ranked ballot says what comes before what, but not how intensely a voter cares about the difference.

That limit does not make democracy incoherent. It means every decision rule makes tradeoffs, and those tradeoffs need to be explicit.

Where Nicolas fits

Nicolas does not turn individual rankings into a social ranking. It asks for costly support and opposition intensities under a finite voice budget.

That moves the decision into a different information model. It is a practical way to measure strength of preference when intensity matters, not a universal escape from impossibility.