Kemeny-Young — Optimal rank aggregation minimising Kendall τ disagreement
KEMENY-YOUNG (Kemeny-Young — Optimal rank aggregation minimising Kendall τ disagreement) is a aggregationoperator multi-criteria decision-making (MCDM) method introduced by Kemeny, J. G. in 1959. It turns a decision matrix of alternatives scored on multiple criteria into a structured, reproducible result.
Key highlights
- Follows a transparent, reproducible computational procedure that can be audited step by step.
- Handles multiple criteria of differing scales and units within a single decision matrix.
Intuition
This section is available to Pro members. Upgrade to Pro
How it works
This section is available to Pro members. Upgrade to Pro
When to use it
Kemeny-Young finds the ranking σ* minimising total Kendall τ distance from all individual rankings (equivalently maximising the Kemeny score). It always elects the Condorcet winner if one exists. Computing the exact solution is NP-hard for large m — use branch-and-bound or genetic algorithm heuristics for m > 8.
Strengths & limitations
- Follows a transparent, reproducible computational procedure that can be audited step by step.
- Handles multiple criteria of differing scales and units within a single decision matrix.
- Results depend on the chosen normalisation, weights, and parameter settings.
Common pitfalls
This section is available to Pro members. Upgrade to Pro
Sources
- 1.Kemeny, J. G. (1959). Mathematics without numbers. Daedalus
You have read it. What now?
Cite this page
ScholarGate. (2026, June 2). KEMENY-YOUNG. ScholarGate. https://scholargate.app/decision-making/kemeny-young