This page is published in English.
Outranking
ELECTRE I - ELimination Et Choix Traduisant la REalité I (kernel / choice)
Outranking - concordance/discordance with kernel extraction
Roy, B.1968doi:10.1051/ro/196802v100571 ↗
Overview
ELECTRE I produces a choice recommendation (kernel), NOT a complete ranking. The kernel K contains alternatives not dominated by any other. Increase c̄ or decrease d̄ to obtain a smaller, more selective kernel.
- Output
- preference flow, higher is better
- Data
- Crisp, complete numeric matrix
- Weights
- Needs a weight source
- Size
- 2+ alternatives, 3-12 criteria works best
- Used for
- Complex multi-stakeholder decisions
How it works
- 1
Vector normalisation of decision matrix.
Roy 1968, p.61 Eq.(1)
- 2
Weighted normalised matrix v_ij = w_j r_ij.
Roy 1968, p.61 Eq.(2)
- 3
Concordance index C(a,b) = Σ_{j: Δ_j(a,b)≥0} w_j.
Roy 1968, p.62 Eq.(3)
- 4
Discordance index D(a,b) = max(-Δ_j(a,b))/max|v_kj−v_lj|.
Roy 1968, p.62 Eq.(4)
- 5
Concordance/discordance thresholds c̄ and d̄.
Roy 1968, p.63 Eqs.(5)-(6)
- 6
Outranking relation a S b ⟺ C(a,b)≥c̄ AND D(a,b)≤d̄; kernel via graph.
Roy 1968, p.63 Eq.(7)
Look elsewhere when
- •Small dataset (m<3). Outranking benefit minimal.
- •Compensatory preferences acceptable. Simpler ranking method.
Assumptions to verify
- Decision-maker can specify preference (p), indifference (q), and veto (v) thresholds
- Non-compensatory preference structure
Limitations
- •Rank reversal known on alternative-set changes (ref: general MCDM literature)
Edge cases and pitfalls
Empty kernel: thresholds too strict - lower c̄ or raise d̄.
Full kernel (no outranking relations): thresholds too lenient - raise c̄ or lower d̄.
Works with
How to cite
Roy, B. (1968). Classement et choix en présence de points de vue multiples (la méthode ELECTRE). RIRO - Revue d'Informatique et de Recherche Opérationnelle. https://doi.org/10.1051/ro/196802v100571
System ID, as it appears in reports and the API
ELECTRE-I