| Condor | n. [ Sp. condor, fr. Peruvian cuntur. ] 1. (Zool.) A very large bird of the Vulture family (Sarcorhamphus gryphus), found in the most elevated parts of the Andes. [ 1913 Webster ] 2. (Zool.) The California vulture (Gymnogyps californianus), also called California condor. [ Local, U. S. ] In the late 20th century it is classed as an endangered species. The California condor used to number in the thousands and ranged along the entire west coast of the United States. By 1982 only 21 to 24 individuals could be identified in the wild. A breeding program was instituted, and by 1996 over 50 birds were alive in captivity. As of 1997, fewer than ten of the bred birds had been reintroduced into the wild. [ Webster 1913 Suppl. +PJC ] 3. A gold coin of Chile, bearing the figure of a condor, and equal to twenty pesos. It contains 10.98356 grams of gold, and is equivalent to about $7.29. Called also colon. [ Webster 1913 Suppl. ] 4. A gold coin of Colombia equivalent to about $9.65. It is no longer coined. [ Webster 1913 Suppl. ] | | Condorcet | pos>prop. n. Marie Jean Antoine Nicolas de Caritat, Marquis de Condorcet, was a celebrated French philosopher and mathematician, Born at Ribemont, near St. Quentin, France, Sept. 17, 1743: died at Bourg-la-Reine, near Paris, March 28, 1794. . His most important work was on probability and the philosophy of mathematics. He was a deputy to the Legislative Assembly in 1791, and its president 1792, and a deputy to the Convention in 1792, where he sided with the Girondists. After the fall of the latter he was accused (Oct. 3, 1793) with Brissot, and went into hiding in Paris for eight months to save his life. He found shelter with a Madame Vernet. He then left the city, but was arrested at Clamart, near Bourg-la-Reine, and imprisoned. The next morning he was found dead, probably from poison. He contributed to the “Encyclopédie, ” and wrote “Esquisse d'un tableau historique des progrès de l'esprit humain” (1794), and various mathematical works.
His most important mathematical treatise was “Essay on the Application of Analysis to the Probability of Majority Decisions” (1785), an extremely important work in the development of the theory of probability. His work in probability led him to a study of voting methods, and laid the groundwork for the various ranked-pairs voting methods, which are often referred to as Condorcet's Method (for which see here. Robert D. Hilliard + Century Dictionary, 1906 [ PJC ] | | Condorcet's method | Condorcet's method is one of several pairwise methods, which are great methods for electing people in single-seat elections (president, governor, mayor, etc.). Condorcet's method is named after the 18th century election theorist who invented it. Unlike most methods which make you choose the lesser of two evils, Condorcet's method and other pairwise methods let you rank the candidates in the order in which you would see them elected. The way the votes are tallied is by computing the results of separate pairwise elections between all of the candidates, and the winner is the one that wins a majority in all of the pairwise elections.
The best result of this is that if there is Candidate A on one extreme who pulls 40% of the vote, Candidate B in the middle who only pulls 20% of the vote, and Candidate C on the other extreme who pulls 40% of the vote, Candidate B will get elected as a compromise. Why? Because in a two-way contest between A and B, B would win with 60% of the vote, and in a two-way contest between B and C, B would also win with 60% of the vote. (Note that if B is a loony billionaire, he might not be able to win separate pairwise elections against anyone, and this would be reflected with Condorcet's method.)
Condorcet's method lets voters mark their sincere wishes for who they would like to win the election, without having to consider strategy ("I'd vote for Candidate B, but I'm afraid of wasting my vote."). It's really just a logical extension of majority rule when more than two choices are involved. Other pairwise methods, such as Copeland's method and Smith's method, have other desirable characteristics. The best of the pairwise methods is something that is quite debatable.
Wait, I've heard of this before...
You may have. However, there are many methods other methods similar to this one (though in my opinion, inferior), so don't be so sure. In order to be fair, here are a couple of those other methods:
* Majority preference voting (MPV) -- related to PV. Like PV, the voter simply ranks candidates in an order of preference (e. 1. Perot 2. Clinton 3. Bush). The candidate with the least number of first place votes is eliminated, and their votes are "transferred" to their 2nd choice until a candidate has a majority. It is frequently advocated and is better than our current system, but still has some nasty properties (like possibly knocking compromise candidates out of the running early). MPV is actually in use in Australia, among other places. Also known as Hare's Method.
* Approval -- Voters are allowed to vote for all candidates they approve. For example, Bush-Yes Perot-No Clinton-Yes. The candidate with the highest number of "yes" votes wins. For a more complete explanation, see here.
Rob Lanphier (from https://web.archive.org/web/20050722235546/http://www.eskimo.com/~robla/politics/condorcet.html). [ PJC ] |
|
