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.
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
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
- 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
- Copeland, A. H. (1951). A 'reasonable' social welfare function. Mimeograph, University of Michigan Seminar on Applications of Mathematics to Social Sciences link ↗
How to cite this page
ScholarGate. (2026, June 2). Copeland Method — Pairwise majority voting with net win-loss score. ScholarGate. https://scholargate.app/en/decision-making/copeland