A Condorcet method is any single-winner election method that meets the Condorcet criterion, that is, which always selects the Condorcet winner, the candidate who would beat each of the other candidates in a run-off election, if such a candidate exists. In modern examples, voters rank candidates in order of preference. There are then multiple, slightly differing methods for calculating the winner, due to the need to resolve circular ambiguities—including the Kemeny-Young method, Ranked Pairs, and the Schulze method.
Condorcet methods are named for the eighteenth-century mathematician and philosopher Marie Jean Antoine Nicolas Caritat, the Marquis de Condorcet. Ramon Llull had devised one of the first Condorcet methods in 1299,[1] but this method is based on an iterative procedure rather than a ranked ballot.
Click on link to read much, much more - degree in maths or statistics seems advisable
1 comment:
I've built a couple of tools to help explain why such systems are better than first-past-the-post.
The first was a voting system criteria ranker that explains what some of the more important criteria mean and suggests a system based on those you consider most important.
The second was a parallel elections calculator, which shows the outcome of elections using different systems (all at the same time).
The latest is Modern Ballots, a site that allows people to create elections, share them with friends, and so forth. The back end is open-source and runs Schulze STV, the multi-winner extension of the Schulze Method.
Post a Comment