OLPC Europe/Condorcet Method

From OLPC
< OLPC Europe
Revision as of 11:23, 27 February 2008 by 212.186.208.121 (talk) (New page: The "[http://en.wikipedia.org/wiki/Condorcet-Methode Condorcet Method]" is a single-winner election method. In modern examples, voters rank candidates in order of preference. There are the...)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to: navigation, search

The "Condorcet Method" is a single-winner election method. 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.


Use of Condorcet voting

Condorcet methods are not currently in use in government elections anywhere in the world, but a Condorcet method known as Nanson's method was used in city elections in the United States|U.S. town of Marquette, Michigan in the 1920s<ref>See: Australian electoral reform and two concepts of representation</ref>, and today Condorcet methods are used by a number of private organisations. Organizations which currently use some variant of the Condorcet method are:

  • The Debian project uses the Schulze method for internal referendums and to elect its leader
  • The Software in the Public Interest corporation uses the Schulze method to elect members of its board of directors
  • The Gentoo Linux project uses the Schulze method
  • The Free State Project used Minimax Condorcet|Minimax for choosing its target state
  • The voting procedure for the United Kingdom|uk.* hierarchy of Usenet


References