This article includes a list of general references, but it lacks sufficient corresponding inline citations. Please help to improve this article by introducing more precise citations. (January 2013) (Learn how and when to remove this message)

It has been suggested that this article be merged into Single transferable vote. (Discuss) Proposed since May 2024.

The single transferable vote (STV) is a semi-proportional representation system that elects multiple winners. It is one of several ways of choosing winners from ballots that rank candidates by preference. Under STV, an elector's vote is initially allocated to their first-ranked candidate. Candidates are elected (winners) if their vote tally reaches quota. After this first count, if seats are still open, surplus votes—those in excess of an electoral quota—are transferred from winners to the remaining candidates (hopefuls) according to the surplus ballots' next usable back-up preference.

The system attempts to ensure political parties are represented proportionally without official party lists. There are several variants of the Single Transferable Vote, each having substantially different properties.

Voting

When using an STV ballot, the voter ranks the candidates on the ballot. For example:

Some, but not all single transferable vote systems require a preference to be expressed for every candidate, or for the voter to express at least a minimum number of preferences. Others allow a voter just to mark one preference if that is the voter's desire.

Quota

The quota (sometimes called the threshold) is the number of votes needed to elect a single candidate. Some candidates may be elected without reaching the quota, but any candidate who receives quota is elected.

The Hare quota and the Droop quota are the common types of quota.

The quota is typically set based on the number of valid votes cast, and even if the number of votes in play decreases through the vote count process, the quota remains as set through the process.

Meek's counting method recomputes the quota on each iteration of the count, as described below.

Hare quota

When Thomas Hare originally conceived his version of single transferable vote, he envisioned using the quota:

${\displaystyle {\frac {\text{votes}}{\text{seats}}}}$
The Hare Quota

The Hare quota is mathematically simple.

The Hare quota's large size means that elected members have fewer surplus votes and thus other candidates do not get benefit from vote transfers that they would in other systems. Some candidates may be eliminated in the process who may not have been eliminated under systems that transfer more surplus votes. Their elimination may cause a degree of dis-proportionality that would be less likely with a lower quota, such as the Droop quota.

Droop quota

The most common quota formula is the Droop quota, which is:

${\displaystyle {\frac {\text{votes}}{{\text{seats}}+1}}}$
The Droop Quota

Droop quota is a smaller number of votes than Hare.

Because of this difference, under Droop it is more likely that every winner meets the quota rather than being elected as the last remaining candidate after lower candidates are eliminated. But in real-life elections, if it is allowed for valid ballots to not bear full rankings, it is common even under Droop for one or two candidates to be elected with partial quota at the end, as the field of candidates is thinned to the number of remaining open seats and as the valid votes still in play become scarcer.

The use of Droop leaves a full quota's worth of votes held by unsuccessful candidates, which are effectively ignored. Unlike a system using the Hare quota and mandatory full marking of the ballot, with optional marking and Droop quota, a certain percentage of ballots are not used to elect anyone. As a result, the Droop quota tends to be strongly disproportional (and is in fact the most-biased quota possible).^[1]

Under Droop, a group consisting of at least half of all voters is guaranteed to win control of at least half of all seats.

Counting rules

Until all seats have been filled, votes are successively transferred to one or more "hopeful" candidates (those who are not yet elected or eliminated) from two sources:

• Surplus votes (i.e. those in excess of the quota) of elected candidates (whole votes or all votes at fractional values),
• All votes of eliminated candidates.

(In either case, some votes may be non-transferable as they bear no marked back-up preferences for any non-elected, non-eliminated candidate.)

The possible algorithms for doing this differ in detail, e.g., in the order of the steps. There is no general agreement on which is best, and the choice of method used may affect the outcome.

1. Compute the quota.
2. Assign votes to candidates by first preferences.
3. Declare as winners all candidates who have achieved at least the quota.
4. Transfer the excess votes from winners, if any, to hopefuls.
5. Repeat 3–4 until no new candidates are elected. (Under some systems, votes could initially be transferred in this step to prior winners or losers. This might affect the outcome.)
6. If these steps result in all the seats being filled, the process is complete. Otherwise:
7. Eliminate one or more candidates, typically either the lowest candidate or all candidates whose combined votes are less than the vote of the next highest candidate.
8. Transfer the votes of the eliminated candidates to remaining hopeful candidates.
9. Return to step 3 and go through the loop until all seats are filled. (The last seat or seats might have to be filled by the few remaining candidates when the field of candidates thins to the number of remaining open seats, even if the candidates do not have quota.)

Surplus vote transfers

To minimize wasted votes, surplus votes are transferred to other candidates if possible. The number of surplus votes is known; but none of the various allocation methods is universally preferred. Alternatives exist for deciding which votes to transfer, how to weight the transfers, who receives the votes and the order in which surpluses from two or more winners are transferred. Transfers are attempted when a candidate receives more votes than the quota. Excess votes are transferred to remaining candidates, where possible.

A winner's surplus votes are transferred according to their next usable marked preference. Transfers are only done if there are still seats to fill. In some systems surplus votes are transferred only if they could possibly re-order the ranking of the two least-popular candidates.

In systems where exhausted votes can exist such as optional preferential voting, if the number of votes bearing a next usable marked preference are fewer than the surplus votes, then the transferable votes are simply transferred based on the next usable preference.

If the transferable votes surpass the surplus, then the transfer is done using a formula (p/t)*s, where s is a number of surplus votes to be transferred, t is a total number of transferable votes (that have a second preference) and p is a number of second preferences for the given candidate. This is the whole-vote method used in Ireland and Malta national elections. Transfers are done using whole votes, with some of the votes that are directed to another candidate left behind with the winner and others of the same sort of votes moved in whole to the indicated candidate. Lower preferences piggybacked on the ballots may not be perfectly random and this may affect later transfers. This method can be made easier if only the last incoming parcel of votes is used to determine the transfer, not all of the successful candidate's votes. Such a method is used to elect the lower houses in the Australian Capital Territory and in Tasmania.^[2]

Under some systems, a fraction of the vote is transferred, with a fraction left behind with the winner. As all votes are transferred (but at fractional value), there is no randomness and exact reduction of the successful candidate's votes are guaranteed. However the fractions may be tedious to work with.

Hare STV the whole-vote method

If the transfer is of surplus received in the first count, transfers are done in reference to all the votes held by the successful candidate.

If the transfer is of surplus received after the first count through transfer from another candidate, transfers are done in reference to all the votes held by the successful candidate or merely in reference to the most recent transfer received by the successful candidate.

Reallocation ballots are drawn at random from those most recently received. In a manual count of paper ballots, this is the easiest method to implement.

Votes are transferred as whole votes. Fractional votes are not used.

This system is close to Thomas Hare's original 1857 proposal. It is used in elections in the Republic of Ireland to Dáil Éireann (the lower chamber),^[3] to local government,^[4] to the European Parliament,^[5] and to the university constituencies in Seanad Éireann (the upper chamber).^[6]

This is sometimes described as "random" because it does not consider later back-up preferences but only the next usable one. Through random drawing of the votes to make up the transfer, statistically the transfers often reflect the make-up of the votes held by the successful candidate.

Sometimes, ballots of the elected candidate are manually mixed. In Cambridge, Massachusetts, votes are counted one precinct at a time, imposing a spurious ordering on the votes. To prevent all transferred ballots coming from the same precinct, every ${\displaystyle n}$th ballot is selected, where ${\displaystyle {\begin{matrix}{\frac {1}{n}}\end{matrix}}}$ is the fraction to be selected.

Wright system

The Wright system is a reiterative linear counting process where on each candidate's exclusion the quota is reset and the votes recounted, distributing votes according to the voters' nominated order of preference, excluding candidates removed from the count as if they had not been nominated.

For each successful candidate that exceeds the quota threshold, calculate the ratio of that candidate's surplus votes (i.e., the excess over the quota) divided by the total number of votes for that candidate, including the value of previous transfers. Transfer that candidate's votes to each voter's next preferred hopeful. Increase the recipient's vote tally by the product of the ratio and the ballot's value as the previous transfer (1 for the initial count.)

Every preference continues to count until the choices on that ballot have been exhausted or the election is complete. Its main disadvantage is that given large numbers of votes, candidates and/or seats, counting is administratively burdensome for a manual count due to the number of interactions. This is not the case with the use of computerized distribution of preference votes.

From May 2011 to June 2011, the Proportional Representation Society of Australia reviewed the Wright System noting:

While we believe that the Wright System as advocated by Mr. Anthony van der Craats system is sound and has some technical advantages over the PRSA 1977 rules, nevertheless for the sort of elections that we (the PRSA) conduct, these advantages do not outweigh the considerable difficulties in terms of changing our (The PRSA) rules and associated software and explaining these changes to our clients. Nevertheless, if new software is written that can be used to test the Wright system on our election counts, software that will read a comma separated value file (or OpenSTV blt files), then we are prepared to consider further testing of the Wright system.^{[citation needed]}

Hare-Clark

This variation is used in Tasmanian and ACT lower house elections in Australia. The Gregory method (trasferring fractional votes) is used but the allocation of transfers is based just on the next usable preference marked on the votes of the last bundle transferred to the successful candidate.^[7]

The last bundle transfer method has been criticized as being inherently flawed in that only one segment of votes is used to transfer the value of surplus votes, denying the other voters who contributed to a candidate's success a say in the surplus distribution. In the following explanation, Q is the quota required for election.

1. Count the first preferences votes.
2. Declare as winners those candidates whose total is at least Q.
3. For each winner, compute surplus (total number of votes minus Q).
4. For each winner, in order of descending surplus:
   1. Assign that winner's ballots to candidates according to the next usable preference on each ballot of the last parcel received, setting aside exhausted ballots.
   2. Calculate the ratio of surplus to the number of reassigned ballots or 1 if the number of such ballots is less than surplus.
   3. For each candidate, multiply ratio * the number of that candidate's reassigned votes and add the result (rounded down) to the candidate's tally.
5. Repeat 3–5 until winners fill all seats, or all ballots are exhausted.
6. If more winners are needed, declare a loser the candidate with the fewest votes, and reassign that candidate's ballots according to each ballot's next preference.

Example

Two seats need to be filled among four candidates: Andrea, Brad, Carter, and Delilah. 57 voters cast ballots with the following preference orderings:

The quota is calculated as ${\displaystyle {57 \over 2+1}=18}$. In the first round, Andrea is elected, and her 21 surplus votes are transferred. In the second, Carter, the candidate with the fewest votes, is excluded. His 8 votes have Brad as the next choice. This gives Brad 20 votes (a full quota), electing him to the second seat:

Count:	Andrea	Brad	Carter	Delilah	Result
1st	39 Y	0	0	17	Andrea elected
2nd	18 Y	12	8 N	17	Carter eliminated
3rd	18 Y	20 Y	0 N	17	Brad elected

Other systems, such as the ones used in Ashtabula, Kalamazoo, Sacramento and Cleveland, prescribed that the votes to be transferred would be drawn at random but in equal numbers from each polling place. In the STV system used in Cincinnati (1924-1957) and in Cambridge city elections, votes received by a winning candidate were numbered sequentially, then if the surplus votes made up one quarter of the votes held by the successful candidate, each vote that was numbered a multiple of four was extracted and moved to the next usable marked preference on each of those votes. (In British, Irish and Canadian uses of STV the whole-vote method outlined above was used.)^[8]

Gregory

The Gregory method, known as Senatorial rules (after its use for most seats in Irish Senate elections), or the Gregory method (after its inventor in 1880, J. B. Gregory of Melbourne) eliminates all randomness. Instead of transferring a fraction of votes at full value, transfer each of the votes at a fractional value.

In the above example, the relevant fraction is ${\displaystyle \textstyle {\frac {72}{272-92}}={\frac {4}{10}}}$. Note that part of the 272 vote result may be from earlier transfers; e.g., perhaps Y had been elected with 250 votes, 150 with X as next preference, so that the previous transfer of 30 votes was actually 150 ballots at a value of ${\displaystyle \textstyle {\frac {1}{5}}}$. In this case, these 150 ballots would now be retransferred with a compounded fractional value of ${\displaystyle \textstyle {\frac {1}{5}}\times {\frac {4}{10}}={\frac {4}{50}}}$.

In the Republic of Ireland, the Gregory Method is used for elections to the 43 seats on the vocational panels in Seanad Éireann, whose franchise is restricted to 949 members of local authorities and members of the Oireachtas (the Irish Parliament).^[9] In Northern Ireland, the Gregory Method has been used since 1973 for all STV elections, with up to 7 fractional transfers (in 8-seat district council elections), and up to 700,000 votes counted (in 3-seat European Parliament elections for the Northern Ireland constituency from 1979 to 2020).

An alternative means of expressing Gregory in calculating the Surplus Transfer Value applied to each vote is

$${\displaystyle {\text{surplus transfer value}}=\left({{{\text{total value of candidate's votes}}-{\text{quota}}} \over {\text{total value of candidate's votes}}}\right)\times {\text{value of each vote}}}$$

The Unweighted Inclusive Gregory Method is used for the Australian Senate.^[10]

Transfer using a party-list allocation method

The effect of the Gregory system can be replicated without using fractional values by a party-list proportional allocation method, such as D'Hondt, Webster/Sainte-Laguë or Hare-Niemeyer. A party-list proportional representation electoral system allocates a share of the seats in a legislature to a political party in proportion to its share of the votes, a task which is mathematically equivalent to establishing a share of surplus votes to be transferred to a hopeful candidate based on the overall vote for an eliminated candidate.

Example: If the quota is 200 and a winner has 272 first-choice votes, then the surplus is 72 votes. If 92 of the winner's 272 votes have no other hopeful listed, then the remaining 180 votes have a second-choice selection and can be transferred.

Of the 180 votes which can be transferred, 75 have hopeful X as their second-choice, 43 have hopeful Y as their second-choice, and 62 have hopeful Z as their second-choice. The D'Hondt system is applied to determine how the surplus votes would be transferred - successive quotients are calculated for each hopeful candidate, one surplus vote is transferred to the hopeful candidate with the largest quotient, and the hopeful candidate's quotient is recalculated; this is repeated until all surplus votes have been transferred.

As a result of this process, 30 surplus votes have been transferred to hopeful X, 17 to hopeful Y, and 25 to hopeful Z.

Secondary preferences for prior winners

Suppose a ballot is to be transferred and its next preference is for a winner in a prior round. Hare and Gregory ignore such preferences and transfer the ballot to the next usable marked preference if any.

In other systems, the vote could be transferred to that winner and the process continued. For example, a prior winner X could receive 20 transfers from second round winner Y. Then select 20 at random from the 220 for transfer from X. However, some of these 20 ballots may then transfer back from X to Y, creating recursion. In the case of the Senatorial rules, since all votes are transferred at all stages, the recursion is infinite, with ever-decreasing fractions.

Meek

In 1969, B. L. Meek devised a vote counting algorithm based on Senatorial (Gregory) vote counting rules. The Meek algorithm uses an iterative approximation to short-circuit the infinite recursion that results when there are secondary preferences for prior winners. This system is currently used for some local elections in New Zealand,^[11][12] and for elections of moderators on some internet websites, e.g. Stack Exchange Network portals.^[13]

All candidates are allocated one of three statuses – Hopeful, Elected, or Excluded. Hopeful is the default. Each status has a weighting, or keep value, which is the fraction of the vote a candidate will receive for any preferences allocated to them while holding that status.

The weightings are:

Hopeful	${\displaystyle 1}$
Excluded	${\displaystyle 0}$
Elected	${\displaystyle w_{\text{new}}=w_{\text{old}}\times {\frac {\text{Quota}}{\text{Candidate's votes}}}}$ which is repeated until ${\displaystyle {\text{Candidate's votes}}={\text{Quota}}}$ for all elected candidates Zdroj:https://en.wikipedia.org?pojem=Gregory_method Text je dostupný za podmienok Creative Commons Attribution/Share-Alike License 3.0 Unported; prípadne za ďalších podmienok. Podrobnejšie informácie nájdete na stránke Podmienky použitia.  Navigácia: Veda > Analytika Antropológia Aplikované vedy Bibliometria Dejiny vedy Encyklopédie Filozofia vedy Forenzné vedy Humanitné vedy Knižničná veda Kryogenika Kryptológia Kulturológia Literárna veda Medzidisciplinárne oblasti Metódy kvantitatívnej analýzy Metavedy Metodika Metodológia vedy Náboženstvo a veda Náučná literatúra Podvody vo vede Popularizácia vedy Potravinárstvo Prírodné vedy Pseudoveda Scientometria Spoločenské vedy Teórie Teatrológia Technické vedy Technika Terminológia Umenie Výskum Veda Veda a technika podľa štátu Veda a technika podľa kontinentu Veda a technika podľa roka Veda v kozme Vedci Vedecká literatúra Vedecké databázy Vedecké experimenty Vedecké konferencie Vedecké metódy Vedecké ocenenia Vedecké organizácie Vedecké parky Vedeckí spisovatelia Vzdelávanie Záhady Príbuzné výrazy: Text je dostupný za podmienok Creative Commons Attribution/Share-Alike License 3.0 Unported; prípadne za ďalších podmienok. Podrobnejšie informácie nájdete na stránke Podmienky použitia. www.astronomia.sk | www.biologia.sk | www.botanika.sk | www.dejiny.sk | www.economy.sk | www.elektrotechnika.sk | www.estetika.sk | www.farmakologia.sk | www.filozofia.sk | Fyzika | www.futurologia.sk | www.genetika.sk | www.chemia.sk | www.lingvistika.sk | www.politologia.sk | www.psychologia.sk | www.sexuologia.sk | www.sociologia.sk | www.veda.sk I www.zoologia.sk