A group G is decisive when the rule ranks x strictly above y whenever every individual in
G does.
Docs / Semantics / Aggregation / Arrow
Arrow's theorem
import Linglib.Semantics.Aggregation.Arrow · namespace Aggregation
This file proves Arrow's theorem. With three or more alternatives, a rule on profiles of values that is ordinally invariant, outputs weak orderings, respects weak Pareto and is independent of irrelevant alternatives has a dictator, an individual whose strict rankings are the strict overall rankings. Ordinal invariance makes the values carry no more than each individual's ranking, which recovers Arrow's setting. The proof is by field expansion and group contraction: the whole population is decisive, an almost decisive group is decisive for every pair, and a decisive group with two or more members has a decisive proper subgroup.
Main statements
Aggregation.exists_isDictator: a rule meeting Arrow's conditions has a dictator.Aggregation.arrow: no rule meets all of Arrow's conditions.
References
- Arrow 1950, A Difficulty in the Concept of Social Welfare
- Sen 1970, Collective Choice and Social Welfare
Arrow's theorem
A group G is decisive for the pair x, y when the rule ranks x strictly above y whenever
every individual in G does.
- DecisiveOn a G x y = ∀ (v : Profile ι α K), (∀ i ∈ G, v y i < v x i) → AsymmRel (a v) x y
Used by DecisiveOn.almost, decisive_of_decisiveOn, decisiveOn_of_almost, decisiveOn_of_almost', decisiveOn_of_almost_of_ne
A group G is almost decisive for the pair x, y when it prevails if every individual outside
G ranks y strictly above x.
- AlmostDecisiveOn a G x y = ∀ (v : Profile ι α K), (∀ i ∈ G, v y i < v x i) → (∀ i ∉ G, v x i < v y i) → AsymmRel (a v) x y
Used by DecisiveOn.almost, decisiveOn_of_almost, decisiveOn_of_almost', decisiveOn_of_almost_of_ne
Built from ,
Built from ,
Built from ,
Built from ,
Built from
Arrow's theorem says that with three or more alternatives a rule that is ordinally invariant, outputs weak orderings, respects weak Pareto and is independent has a dictator.
Arrow's theorem for a rule that is a function of the individuals' orderings of the objects.
Arrow's theorem is an impossibility, since no rule meets all of Arrow's conditions.