Condorcet method

E1427387 UNEXPLORED

The Condorcet method is a family of voting systems in which the winner is the candidate who would defeat every other candidate in head-to-head majority contests.

All labels observed (6)

How this entity was disambiguated

Referenced by (12)

Full triples — surface form annotated when it differs from this entity's canonical label.

social choice theory → hasKeyConcept → Condorcet method ⓘ
Condorcet criterion → defines → Condorcet winner ⓘ
linked to: Condorcet method
Condorcet criterion → relatedConcept → Condorcet method ⓘ
Condorcet criterion → satisfiedBy → Ranked Pairs ⓘ
linked to: Condorcet method
Condorcet criterion → satisfiedBy → Minimax Condorcet method ⓘ
linked to: Condorcet method
Debian Project Leader → electionMethod → Condorcet method ⓘ
Project Leader → electionMethod → Condorcet voting ⓘ
linked to: Condorcet method
General Resolution (Debian) → uses → Condorcet method ⓘ
subject linked to: General Resolution
Amendment of the Constitution → uses → Condorcet method with Cloneproof Schwartz Sequential Dropping ⓘ
linked to: Condorcet method
Debian Project Secretary → usesVotingMethod → Condorcet method ⓘ
median voter theorem → relatedTo → Condorcet winner ⓘ
linked to: Condorcet method
Condorcet jury theorem → relatedTo → Condorcet method ⓘ