Docs / Semantics / Aggregation / Rules

Classical aggregation rules

import Linglib.Semantics.Aggregation.Rules · namespace Aggregation

This file defines six classical aggregation rules, each ranking objects by a relation on their vectors of values, and the conditions they meet or fail. Majority rule, after May, meets every Arrow condition except weak-ordering outputs. The Pareto rule, after Weymark, is a quasi-ordering that leaves every trade-off incomparable, and Sen's Pareto extension rule makes those incomparabilities indifferences. The utilitarian rule and the maximin rule each meet Arrow's conditions once values are comparable across individuals, the first with a common unit and the second with a common ordinal scale; the Cobb–Douglas rule, after Tsui and Weymark, is ratio-scale invariant on non-negative profiles. The Pareto rule is the infimum of the utilitarian rules with positive weights and the Pareto extension rule their supremum, by the self-duality of the nonnegative orthant.

References

  • May 1952, A Set of Independent Necessary and Sufficient Conditions for Simple Majority Decision
  • Sen 1970, Collective Choice and Social Welfare
  • Tsui & Weymark 1997, Social Welfare Orderings for Ratio-Scale Measurable Utilities
  • Weymark 1984, Arrow’s Theorem with Social Quasi-Orderings

Majority rule

L47–49
L51–53

The Pareto rule

L118–120
L126–130
L156–158
L174–183

The utilitarian rule

L205–207
L209–211
L222–226
L230–235
L246–259

With positive weights on two or more individuals the utilitarian rule meets Arrow's conditions with cardinal unit comparability in place of ordinal non-comparability (Sen 1970).

theorem utilitarian_arrovian_cardinalUnitL261–268
{ι : Type u_1} {α : Type u_2} {K : Type u_3} [Fintype ι] [Field K] [LinearOrder K] (c : ι → K) [IsStrictOrderedRing K] [Nontrivial ι] [Nontrivial α] (hc : ∀ (i : ι), 0 < c i) :

Built from

L270–275
L277–301
L307–335
L339–343
L345–349
L359–366

The maximin rule

L376–378
L380–383
L385–394
L408–417

The Cobb–Douglas rule

L445–447
L458–464