Академический Документы
Профессиональный Документы
Культура Документы
Jump to: navigation, search The bully algorithm is a method in distributed computing for dynamically selecting a
coordinator by process ID number. When a process P determines that the current coordinator is down because of message timeouts or failure of the coordinator to initiate a handshake, it performs the following sequence of actions: 1. P broadcasts an election message (inquiry) to all other processes with higher process IDs. 2. If P hears from no process with a higher process ID than it, it wins the election and broadcasts victory. 3. If P hears from a process with a higher ID, P waits a certain amount of time for that process to broadcast itself as the leader. If it does not receive this message in time, it re-broadcasts the election message. 4. If P gets an election message (inquiry) from another process with a lower ID it sends an "I am alive" message back and starts new elections. Note that if P receives a victory message from a process with a lower ID number, it immediately initiates a new election. This is how the algorithm gets its name - a process with a higher ID number will bully a lower ID process out of the coordinator position as soon as it comes online.
Jump to: navigation, search For other uses, see Voting system (disambiguation).
Part of the Politics series
Electoral methods
Single-winner
Simple majoritarianism
Plurality
o o
Preferential systems
o o o o o o
Condorcet methods Copeland's method KemenyYoung method Minimax Nanson's method Ranked pairs Schulze method Bucklin voting Oklahoma primary electoral system Coombs' method Instant-runoff (alternative vote) Contingent vote Borda count
Rated systems
o o o
Proportional representation
D'Hondt method Sainte-Lagu method Largest remainder Hare quota Droop quota Imperiali quota CPO-STV Schulze STV Wright system
Semi-proportional representation
o o o o
Cumulative voting Limited voting Single non-transferable vote Additional member system Parallel voting
Majoritarian representation
o o o
Arrow's theorem GibbardSatterthwaite theorem Voting system criteria Politics portal vde
A voting system or electoral system is a method by which voters make a choice between options, often in an election or on a policy referendum. A voting system contains rules for valid voting, and how votes are counted and aggregated to yield a final result. Since voting involves counting, it is algorithmic in nature, and, since it involves polling the sentiments of a person, this represents affective data. Together, with the exception of proxy voting, this corresponds to in-degree centrality in graph theory and social network analysis, with votes as directed edges, and voters and candidates as nodes.[1] Common voting systems are majority rule, proportional representation or plurality voting with a number of variations and methods such as first-past-the-post or preferential voting. The study of formally defined voting systems is called voting theory, a subfield of political science, economics, or mathematics. With majority rule, those who are unfamiliar with voting theory are often surprised that another voting system exists, or that disagreements may exist over the definition of what it means to be supported by a majority. Depending on the meaning chosen, the common "majority rule" systems can produce results that the majority does not support. If every election had only two choices, the winner would be determined using majority rule alone. However, when there are three or more options, there may not be a single option that is most liked or most disliked by a majority. A simple choice does not allow voters to express the ordering or the intensity of their feeling. Different voting systems may give very different results, particularly in cases where there is no clear majority preference.
Contents
[hide]
1 Aspects of voting systems o 1.1 The ballot o 1.2 Candidates o 1.3 Weight of votes o 1.4 Status quo o 1.5 Constituencies 2 Multiple-winner methods o 2.1 Proportional methods o 2.2 Semiproportional methods o 2.3 Nonproportional and semiproportional methods 3 Single-winner methods o 3.1 Single or sequential vote methods o 3.2 Ranked voting methods o 3.3 Rated voting methods o 3.4 Evaluating voting systems using criteria 3.4.1 Mathematical criteria 3.4.1.1 Compliance of selected systems (table) 3.4.2 Experimental criteria 3.4.3 "Soft" criteria 4 History o 4.1 Early democracy o 4.2 Foundations of voting theory o 4.3 The single-winner revival o 4.4 Influence of game theory o 4.5 Post-1980 developments 5 See also 6 References o 6.1 Notes on systems comparison table o 6.2 General references o 6.3 References 7 External links
The real-world implementation of an election is generally not considered part of the voting system. For example, though a voting system specifies the ballot abstractly, it does not specify whether the actual physical ballot takes the form of a piece of paper, a punch card, or a computer display. A voting system also does not specify whether or how votes are kept secret, how to verify that votes are counted accurately, or who is allowed to vote. These are aspects of the broader topic of elections and election systems.
In a simple plurality ballot, the voter is expected to mark only one selection. Different voting systems have different forms for allowing the individual to express his or her vote. In ranked ballot or "preference" voting systems, such as Instant-runoff voting, the Borda count, or a Condorcet method, voters order the list of options from most to least preferred. In range voting, voters rate each option separately on a scale. In plurality voting (also known as "first-past-the-post"), voters select only one option, while in approval voting, they can select as many as they want. In voting systems that allow "plumping", like cumulative voting, voters may vote for the same candidate multiple times. Some voting systems include additional choices on the ballot, such as write-in candidates, a none of the above option, or a no confidence in that candidate option.
[edit] Candidates
Some methods call for a primary election first to determine which candidates will be on the ballot.
Many elections are held to the ideal of "one person, one vote," meaning that every voter's votes should be counted with equal weight. This is not true of all elections, however. Corporate elections, for instance, usually weight votes according to the amount of stock each voter holds in the company, changing the mechanism to "one share, one vote". Votes can also be weighted unequally for other reasons, such as increasing the voting weight of higher-ranked members of an organization. Voting weight is not the same thing as voting power. In situations where certain groups of voters will all cast the same vote (for example, political parties in a parliament), voting power measures the ability of a group to change the outcome of a vote. Groups may form coalitions to maximize voting power. In some German states, most notably Prussia and Sachsen, there was before 1918 a weighted vote system known as the Prussian three-class franchise, where the electorate would be divided into three categories based on the amount of income tax paid. Each category would have equal voting power in choosing the electors.[2] they are known as candidates
[edit] Constituencies
Main article: Constituency Often the purpose of an election is to choose a legislative body made of multiple winners. This can be done by running a single election and choosing the winners from the same pool of votes, or by dividing up the voters into constituencies that have different options and elect different winners. Some countries, like Israel, fill their entire parliament using a single multiple-winner district (constituency), while others, like the Republic of Ireland or Belgium, break up their national elections into smaller multiple-winner districts, and yet others, like the United States or the United Kingdom, hold only single-winner elections. The Australian bicameral Parliament has single-member electorates for the legislative body (lower house) and multi-
member electorates for its Senate (upper house). Some systems, like the Additional member system, embed smaller districts (constituencies) within larger ones. The way constituencies are created and assigned seats can dramatically affect the results. Apportionment is the process by which states, regions, or larger districts are awarded seats, usually according to population changes as a result of a census. Redistricting is the process by which the borders of constituencies are redrawn once apportioned. Both procedures can become highly politically contentious due to the possibility of both malapportionment, where there are unequal representative to population ratios across districts, and gerrymandering, where electoral districts are manipulated for political gain. An example of this were the UK Rotten and pocket boroughs, parliamentary constituencies that had a very small electorate - e.g. an abandoned town - and could thus be used by a patron to gain undue and unrepresentative influence within parliament. This was a feature of the unreformed House of Commons before the Great Reform Act of 1832.
Seats won by each party in the 2005 German federal election, an example of a proportional voting system. Most Western democracies use some form of multiple-winner voting system, with the United States and the United Kingdom being notable exceptions. A vote with multiple winners, such as the election of a legislature, has different practical effects than a single-winner vote. Often, participants in a multiple winner election are more concerned with the overall composition of the legislature than exactly which candidates get elected. For this reason, many multiple-winner systems aim for proportional representation, which means that if a given party (or any other political grouping) gets X% of the vote, it should also get approximately X% of the seats in the legislature. Not all multiple-winner voting systems are proportional.
opinions of 1000 voters, within a margin of error. This can be measured using the Gallagher Index. Most proportional systems in use are based on party-list proportional representation, in which voters vote for parties instead of for individual candidates.[3] For each quota of votes a party receives, one of their candidates wins a seat on the legislature. The methods differ in how the quota is determined or, equivalently, how the proportions of votes are rounded off to match the number of seats. The methods of seat allocation can be grouped overall into highest averages methods and largest remainder methods. Largest remainder methods set a particular quota based on the number of voters, while highest averages methods, such as the Sainte-Lagu method and the d'Hondt method, determine the quota indirectly by dividing the number of votes the parties receive by a sequence of numbers. Independently of the method used to assign seats, party-list systems can be open list or closed list. In an open list system, voters decide which candidates within a party win the seats. In a closed list system, the seats are assigned to candidates in a fixed order that the party chooses. The Mixed Member Proportional system is a mixed method that only uses a party list for a subset of the winners, filling other seats with the winners of regional elections, thus having features of open list and closed list systems. In contrast to party-list systems, the Single Transferable Vote is a proportional representation system in which voters rank individual candidates in order of preference. Unlike party-list systems, STV does not depend on the candidates being grouped into political parties. Votes are transferred between candidates in a manner similar to instant runoff voting, but in addition to transferring votes from candidates who are eliminated, excess votes are also transferred from candidates who already have a quota.
This ballot design, used in cumulative voting, allows a voter to split his vote among multiple candidates. Cumulative voting is a common way of holding elections in which the voters have unequal voting power, such as in corporate governance under the "one share, one vote" rule. Cumulative voting is also used as a multiple-winner method, such as in elections for a corporate board. Cumulative voting is not fully proportional because it suffers from the same spoiler effect of the plurality voting system without a run-off process. A group of like-minded voters divided among "too many" candidates may fail to elect any winners, or elect fewer than they deserve by their size. The level of proportionality depends on how well-coordinated the voters are. Limited voting is a multi-winner system that gives voters fewer votes than the number of seats to be decided. The simplest and most common form of limited voting is Single NonTransferable Vote (SNTV). It can be considered a special variation of cumulative voting where a full vote cannot be divided among more than one candidate. It depends on a statistical distributions of voters to smooth out preferences that CV can do by individual voters. For example, in a 4-seat election a candidate needs 20% to guarantee election. A coalition of 40% can guarantee 2-seats in CV by perfectly splitting their votes as individuals between 2 candidates. In comparison, SNTV tends towards collectively dividing 20% between each candidate by assuming every coalition voter flipped a coin to decide which candidate to support with their single vote. This limitation simplifies voting and counting, at the cost of more uncertainty of results.
An example of runoff voting. Runoff voting involves two rounds of voting. Only two candidates continue to the second round. The most prevalent single-winner voting method, by far, is plurality (also called "first-pastthe-post", "relative majority", or "winner-take-all"), where each voter votes for one choice, and the choice that receives the most votes wins, even if it receives less than a majority of votes.
Runoff methods hold multiple rounds of plurality voting to ensure that the winner is elected by a majority. Top-two runoff voting, the second most common method used in elections, holds a runoff election between the two highest polling options if there is no absolute majority (50% plus one). In elimination runoff elections, the weakest candidate(s) are eliminated until there is a majority. A primary election process is also used as a two round runoff voting system. The two candidates or choices with the most votes in the open primary ballot progress to the general election. The difference between a runoff and an open primary is that a winner is never chosen in the primary, while the first round of a runoff can result in a winner if one candidate has over 50% of the vote. In the Random ballot method, each voter votes for one option and a single ballot is selected at random to determine the winner. This is mostly used as a tiebreaker for other methods.
In a typical ranked ballot, a voter is instructed to place the candidates in order of preference. Also known as preferential voting methods, these methods allow each voter to rank the candidates in order of preference. Often it is not necessary to rank all the candidates: unranked candidates are usually considered to be tied for last place. Some ranked ballot methods also allow voters to give multiple candidates the same ranking. The most common ranked voting method is instant-runoff voting (IRV), also known as the "alternative vote" or simply preferential voting, which uses voters' preferences to simulate an elimination runoff election without multiple voting events. As the votes are tallied, the option with the fewest first-choice votes is eliminated. In successive rounds of counting,
the next preferred choice still available from each eliminated ballot is transferred to candidates not yet eliminated. The least preferred option is eliminated in each round of counting until there is a majority winner, with all ballots being considered in every round of counting. The Borda count is a simple ranked voting method in which the options receive points based on their position on each ballot. A class of similar methods is called positional voting systems. Other ranked methods include Coombs' method, Supplementary voting, Bucklin voting, and Condorcet method. Condorcet methods, or pairwise methods, are a class of ranked voting methods that meet the Condorcet criterion. These methods compare every option pairwise with every other option, one at a time, and an option that defeats every other option is the winner. An option defeats another option if a majority of voters rank it higher on their ballot than the other option. These methods are often referred to collectively as Condorcet methods because the Condorcet criterion ensures that they all give the same result in most elections, where there exists a Condorcet winner. The differences between Condorcet methods occur in situations where no option is undefeated, implying that there exists a cycle of options that defeat one another, called a Condorcet paradox or Smith set. Considering a generic Condorcet method to be an abstract method that does not resolve these cycles, specific versions of Condorcet that select winners even when no Condorcet winner exists are called Condorcet completion methods. A simple version of Condorcet is Minimax: if no option is undefeated, the option that is defeated by the fewest votes in its worst defeat wins. Another simple method is Copeland's method, in which the winner is the option that wins the most pairwise contests, as in many round-robin tournaments. The Schulze method (also known as "Schwartz sequential dropping", "cloneproof Schwartz sequential dropping" or the "beatpath method") and Ranked pairs are two recently designed Condorcet methods that satisfy a large number of voting system criteria. The Kemeny-Young method, the Schulze method, and the ranked pairs method are Condorcet methods that fully rank all the candidates from most popular to least popular.
On a rated ballot, the voter may rate each choice independently. Rated ballots allow even more flexibility than ranked ballots, but few methods are designed to use them. Each voter gives a score to each option; the allowable scores could be numeric (for example, from 0 to 100) or could be "grades" like A/B/C/D/F.
An approval voting ballot does not require ranking or exclusivity. Rated ballots can be used for ranked voting methods, as long as the ranked method allows tied rankings. Some ranked methods assume that all the rankings on a ballot are distinct, but many voters would be likely to give multiple candidates the same rating on a rated ballot.
In range voting, voters give numeric ratings to each option, and the option with the highest total or average score wins. In majority judgment, similar ballots are used, but the winner is the candidate with the highest median score. Approval voting, where voters may vote for as many candidates as they like, can be seen as an instance of range voting (or majority judgment) where the allowable ratings are 0 and 1. It has recently been studied by, among others Brams 2003 who notes that 'The chief reason for its nonadoption in public elections, and by some societies, seems to be a lack of key "insider" support.' There are variants within cumulative voting. In the points form, each voter has as many votes as there are choices, and can distribute those votes as desired: all on one choice or spread in any other pattern. Cumulative voting is used in a number of communities as well as corporate boards. It was examined and developed perhaps most thoroughly by Lani Guinier (1994).
Using criteria to compare systems does not make the comparison completely objective. For example, it is relatively easy to devise a criterion that is met by one's preferred voting method, and by very few other methods. Doing this, one can then construct a biased argument for the criterion, instead of arguing directly for the method. There is no ultimate authority on which criteria should be considered, but the following are some criteria that are accepted and considered to be desirable by many voting theorists: Majority criterionIf there exists a majority that ranks (or rates) a single candidate at the top, higher than all other candidates, does that candidate always win? Mutual majority criterion (MMC)If there exists a majority that ranks (or rates) a group of candidates higher than all others, does one of those candidates always win? This also implies the Majority loser criterionif a majority of voters prefers every other candidate over a given candidate, then does that candidate not win? Therefore, of the systems listed, all pass neither or both criteria, except for Borda, which passes Majority Loser while failing Mutual Majority. Monotonicity criterion (Monotone)Is it impossible to cause a winning candidate to lose by ranking him higher, or to cause a losing candidate to win by ranking him lower? Consistency criterionIf the electorate is divided in two and a choice wins in both parts, does it always win overall? Participation criterionIs voting honestly always better than not voting at all? (This is grouped with the distinct but similar Consistency Criterion in the table below. [4] ) Condorcet criterionIf a candidate beats every other candidate in pairwise comparison, does that candidate always win? (This implies the majority criterion, above) Condorcet loser criterion (Cond. loser)If a candidate loses to every other candidate in pairwise comparison, does that candidate always lose? Independence of irrelevant alternatives (IIA)If a candidate is added or removed, do the relative rankings of the remaining candidates stay the same? Independence of clones criterion (Cloneproof)Is the outcome the same if candidates identical to existing candidates are added? Reversal symmetryIf individual preferences of each voter are inverted, does the original winner never win? Polynomial time (Polytime)Can the winner be calculated in a runtime that is polynomial in the number of candidates and the number of voters? Summability (Summable)How much information must be transmitted from each polling station to a central location in order to determine the winner? This is expressed as an order function of the number of candidates N. Slower-growing functions such as O(N) or O(N2) make for easier counting, while faster-growing functions such as O(N!) might make it harder to catch fraud by election administrators. Allows equal rankingsCan a voter choose whether to rank any two candidates equally at any position on the ballot? This can reduce the prevalence of spoiled ballots due to overvotes, and can give a less-dishonest alternative to some tactical voting strategies.
Allows later preferences (later prefs)Can a voter indicate different levels of support through ranking or rating candidates? Later-no-harm criterion and Later-no-help criterionCan adding a later preference to a ballot harm/help any candidate already listed? Note that these criteria are not applicable to methods which do not allow later preferences; although such methods technically pass, they can be said to fail from a voter's perspective.[5]
Note on terminology: A criterion is said to be "weaker" than another when it is passed by more voting systems. Frequently, this means that the conditions for the criterion to apply are stronger. For instance, the majority criterion (MC) is weaker than the multiple majority criterion (MMC), because it requires that a single candidate, rather than a group of any size, should win. That is, any system which passes the MMC also passes the MC, but not vice versa; while any required winner under the MC must win under the MMC, but not vice versa.
[edit] Compliance of selected systems (table)
The following table shows which of the above criteria are met by several single-winner systems.
Consis Majo Mon tency/ rity/ Condor o- Partic MM cet tone ipC ation Later Equal Con Revers Pol Lat -noSum ranki d. Clonepr al yer help/ IIA m- ngs lose oof symme tim pref Later able can r try e s -noexist harm
Approva Ambi Yes[nb Ambi Ambig.Yes 2] No[nb 2] No Yes Yes O(N) Yes No[nb 4] [nb 1] l guous guous [nb 3] No Borda No Yes Yes No Yes No (teamin Yes Yes O(N) No Yes No count g) IRV O(N! Yes No No No Yes No Yes No Yes [nb 5] No Yes Yes (AV) ) No No Kemeny O(N2 Yes Yes No Yes Yes (but (teamin Yes No [nb 6] Yes Yes No -Young ) ISDA) g) Majorit Yes[nb No[n O(N Yes/ y Judg- 8] Yes No[nb 9] No[nb 2] b 10] Yes Yes No[nb 11] Yes [nb 12] Yes Yes ) No ment[nb 7] No Some Minima Yes/ Yes[nb O(N2 No[nb Yes No No No (spoiler No Yes varian Yes 13] 13] x No ) s) ts No Yes/ Plurality Yes Yes No No No (spoiler No Yes O(N) No No[nb 4] No s)
Range Yes[nb Yes[nb Ambig.voting[nb No Yes 2] No[nb 2] No 14] Yes Yes O(N) Yes Yes No [nb 3]
1]
Ranked Yes Yes pairs Runoff Yes/ No voting No Schulze Yes Yes
No No No
Yes No Yes
No Yes (but
ISDA)
Yes
Yes Yes
No O(N No[n Yes[nb Yes No (spoiler No Yes [nb 15] No b 16] 17] ) s) No O(N2 Yes (but Yes Yes Yes Yes Yes No ) ISDA)
No
No Yes
No
NA Yes O(0) No No
No
No Yes
Yes
"Yes/No", in a column which covers two related criteria, signifies that the given system passes the first criterion and not the second one.
[edit] Experimental criteria It is possible to simulate large numbers of virtual elections on a computer and see how various voting systems compare in practical terms. Since such investigations are more difficult than simply proving that a given system does or does not satisfy a given mathematical criterion, results are not available for all systems. Also, these results are sensitive to the parameters of the model used to generate virtual elections, which can be biased either deliberately or accidentally. One desirable feature that can be explored in this way is maximum voter satisfaction, called in this context minimum Bayesian regret. Such simulations are sensitive to their assumptions, particularly with regard to voter strategy, but by varying the assumptions they can give repeatable measures that bracket the best and worst cases for a voting system.[6] To date, the only such simulation to compare a wide variety of voting systems was run by a range-voting advocate and has not been peer-reviewed.[7][8] It found that Range voting consistently scored as either the best system or among the best across the various conditions studied.[9] Another aspect which can be compared through such Monte Carlo simulations is strategic vulnerability. According to the Gibbard-Satterthwaite theorem, no voting system can be immune to strategic manipulation in all cases, but certainly some systems will have this problem more often than others. M. Badinski and R. Laraki, the inventors of the majority
judgment system, performed such an investigation using a set of simulated elections based on the results from a poll of the 2007 French presidential election which they had carried out using rated ballots. Comparing range voting, Borda count, plurality voting, approval voting with two different absolute approval thresholds, Condorcet voting, and majority judgment, they found that range voting had the highest (worst) strategic vulnerability, while their own system majority judgment had the lowest (best).[10] Badinski and Laraki also used the same data to investigate how likely it was that each of those systems, as well as runoff voting, would elect a centrist. Opinions differ on whether this is desirable or not. Some argue that systems which favor centrists are better because they are more stable; others argue that electing ideologically purer candidates gives voters more choice and a better chance to retrospectively judge the relative merits of those ideologies; while Badinski and Laraki argue that both centrist extremist candidates should have a chance to win, to prevent forcing candidates into taking either position. Their data showed that plurality, runoff voting, and approval voting with a higher approval threshold tended to elect extremists (100%, 98%, and 94% of the time, respectively); majority judgement elected both centrists and extremists (56% extremists); and range, Borda, and approval voting with a lower approval threshold elected centrists (6%; 0.25%-13% depending on the number of candidates; and 6% extremists; respectively).[11] Simulated elections in a two-dimensional issue space can also be graphed to visually compare election methods; this makes apparent issues like nonmonotonicity, cloneindependence, and tendency to elect centrists vs extremists.[12] [edit] "Soft" criteria In addition to the above criteria, voting systems are judged using criteria that are not mathematically precise but are still important, such as simplicity, speed of vote-counting, the potential for fraud or disputed results, the opportunity for tactical voting or strategic nomination, and, for multiple-winner methods, the degree of proportionality produced. The New Zealand Royal Commission on the Electoral System listed ten criteria for their evaluation of possible new electoral systems for New Zealand. These included fairness between political parties, effective representation of minority or special interest groups, political integration, effective voter participation and legitimacy.
[edit] History
[edit] Early democracy
Voting has been used as a feature of democracy since the 6th century BC, when democracy was introduced by the Athenian democracy. However, in Athenian democracy, voting was seen as the least democratic among methods used for selecting public officials, and was little used, because elections were believed to inherently favor the wealthy and well-known over average citizens. Viewed as more democratic were assemblies open to all citizens, and selection by lot (known as sortition), as well as rotation of office. One of the earliest
recorded elections in Athens was a plurality vote that it was undesirable to "win": in the process called ostracism, voters chose the citizen they most wanted to exile for ten years. Most elections in the early history of democracy were held using plurality voting or some variant, but as an exception, the state of Venice in the 13th century adopted the system we now know as approval voting to elect their Great Council.[13] The Venetians' system for electing the Doge was a particularly convoluted process, consisting of five rounds of drawing lots (sortition) and five rounds of approval voting. By drawing lots, a body of 30 electors was chosen, which was further reduced to nine electors by drawing lots again. An electoral college of nine members elected 40 people by approval voting; those 40 were reduced to form a second electoral college of 12 members by drawing lots again. The second electoral college elected 25 people by approval voting, which were reduced to form a third electoral college of nine members by drawing lots. The third electoral college elected 45 people, which were reduced to form a fourth electoral college of 11 by drawing lots. They in turn elected a final electoral body of 41 members, who ultimately elected the Doge. Despite its complexity, the system had certain desirable properties such as being hard to game and ensuring that the winner reflected the opinions of both majority and minority factions.[14] This process was used with little modification from 1268 until the end of the Republic of Venice in 1797, and was one of the factors contributing to the durability of the republic.
While Condorcet and Borda are usually credited as the founders of voting theory, recent research has shown that the philosopher Ramon Llull discovered both the Borda count and a pairwise method that satisfied the Condorcet criterion in the 13th century. The manuscripts in which he described these methods had been lost to history until they were rediscovered in 2001.[16]
The Marquis de Condorcet, another early voting theorist Later in the 18th century, the related topic of apportionment began to be studied. The impetus for research into fair apportionment methods came, in fact, from the United States Constitution, which mandated that seats in the United States House of Representatives had to be allocated among the states proportionally to their population, but did not specify how to do so.[17] A variety of methods were proposed by statesmen such as Alexander Hamilton, Thomas Jefferson, and Daniel Webster. Some of the apportionment methods discovered in the United States were in a sense rediscovered in Europe in the 19th century, as seat allocation methods for the newly proposed system of party-list proportional representation. The result is that many apportionment methods have two names: for instance, Jefferson's method is equivalent to the d'Hondt method, as is Webster's method to the Sainte-Lagu method, while Hamilton's method is identical to the Hare largest remainder method.[17] The Single Transferable Vote system was devised by Carl Andrae in Denmark in 1855, and also in England by Thomas Hare in 1857. Their discoveries may or may not have been independent. STV elections were first held in Denmark in 1856, and in Tasmania in 1896 after its use was promoted by Andrew Inglis Clark. Party-list proportional representation was first implemented to elect European legislatures in the early 20th century, with Belgium implementing it first in 1899. Since then, proportional and semi-proportional methods have come to be used in almost all democratic countries, with most exceptions being former British colonies.[18]
elections, yielding instant runoff voting.[19] Soon, mathematicians began to revisit Condorcet's ideas and invent new methods for Condorcet completion. Edward J. Nanson combined the newly described instant runoff voting with the Borda count to yield a new Condorcet method called Nanson's method. Charles Dodgson, better known as Lewis Carroll, published pamphlets on voting theory, focusing in particular on Condorcet voting. He introduced the use of matrices to analyze Condorcet elections, though this, too, had already been done in some form in the then-lost manuscripts of Ramon Llull. He also proposed the straightforward Condorcet method known as Dodgson's method. Ranked voting systems eventually gathered enough support to be adopted for use in government elections. In Australia, IRV was first adopted in 1893, and continues to be used along with STV today. In the United States in the early 20th century, various municipalities began to use Bucklin voting. Bucklin is no longer used in any government elections, and has even been declared unconstitutional in Minnesota.[20]