Dodgson Method — Condorcet completion by minimum pairwise swaps
DODGSON (Dodgson Method — Condorcet completion by minimum pairwise swaps) is a aggregationoperator multi-criteria decision-making (MCDM) method introduced by Dodgson, C. L. in 1900. It turns a decision matrix of alternatives scored on multiple criteria into a structured, reproducible result.
Read the full method
Sign in with a free account to read this section.
Method map
The neighbourhood of related methods — select a node to explore.
When to use it
Dodgson selects the alternative that is 'closest' to being a Condorcet winner — measured in pairwise swap distance. Always returns a winner (no paradox), but winner determination is NP-hard for unrestricted preference profiles. For m ≤ 10, exhaustive search is practical; beyond that, use approximation algorithms. Orakçı 2024 (Bölüm 3) shows Dodgson fails to produce full rankings in 82-99% of random samples for m ≥ 3 — use Kemeny or RAT for guaranteed full rankings.
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.
Sources
- Dodgson, C. L. (1900). A method of taking votes on more than two issues (1876). Pamphlet, Clarendon Press, Oxford (original 1876) link ↗
How to cite this page
ScholarGate. (2026, June 2). Dodgson Method — Condorcet completion by minimum pairwise swaps. ScholarGate. https://scholargate.app/en/decision-making/dodgson
Which method?
Set this method beside its closest kin and read them side by side — the library lays the books on the table; the choice is yours.
- AHPDecision-making↔ compare
- ELECTREDecision-making↔ compare
- PROMETHEEDecision-making↔ compare
- TOPSISDecision-making↔ compare
- VIKORDecision-making↔ compare