Condorcet Method — Pairwise majority winner from ranked ballots
CONDORCET (Condorcet Method — Pairwise majority winner from ranked ballots) is a aggregationoperator multi-criteria decision-making (MCDM) method introduced by Marquis de Condorcet 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
The Condorcet criterion is the gold standard for pairwise voting: a Condorcet winner — when it exists — is universally considered the legitimate group choice. The drawback is the Condorcet paradox: cyclic majorities (A>B>C>A) can prevent any winner. Use Schulze, Kemeny, or Copeland to break ties when no Condorcet winner exists.
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
- Marquis de Condorcet (1900). Essai sur l'application de l'analyse à la probabilité des décisions rendues à la pluralité des voix (1785). Imprimerie Royale, Paris (original 1785) link ↗
How to cite this page
ScholarGate. (2026, June 2). Condorcet Method — Pairwise majority winner from ranked ballots. ScholarGate. https://scholargate.app/en/decision-making/condorcet
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