MCDMDecision-makingAggregationOperatorMath steps
Copeland Method — Pairwise majority voting with net win-loss score
COPELAND (Copeland Method — Pairwise majority voting with net win-loss score) is a aggregationoperator multi-criteria decision-making (MCDM) method introduced by Copeland, A. H. in 1951. 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
C_i ∈ [−(m−1), m−1]. A Condorcet winner (beats every other alternative) has C_i = m−1. Copeland is resistant to IIA violations unlike Borda, but can still produce cycles (Condorcet paradox).
Strengths & limitations
Strengths
- 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.
Limitations
- Results depend on the chosen normalisation, weights, and parameter settings.
Common pitfalls
This section is available to Pro members. Upgrade to Pro
Sources
- 1.Copeland, A. H. (1951). A 'reasonable' social welfare function. Mimeograph, University of Michigan Seminar on Applications of Mathematics to Social Sciences
You have read it. What now?
Cite this page
ScholarGate. (2026, June 2). COPELAND. ScholarGate. https://scholargate.app/decision-making/copeland