Droop quota

From testwiki
Jump to navigation Jump to search

Template:Short description Template:Electoral systems In the study of electoral systems, the Droop quota (sometimes called the Hagenbach-Bischoff, Britton, or Newland-Britton quota[1]Template:Efn) is the minimum number of votes a party or candidate needs to receive in a district to guarantee they will win at least one seat.[2][3]

The Droop quota is used to extend the concept of a majority to multiwinner elections, taking the place of the 50% bar in single-winner elections. Just as any candidate with more than half of all votes is guaranteed to be declared the winner in single-seat election, any candidate with more than a Droop quota's worth of votes is guaranteed to win a seat in a multiwinner election.[3]

Besides establishing winners, the Droop quota is used to define the number of excess votes, i.e. votes not needed by a candidate who has been declared elected. In proportional quota–based systems such as STV or expanding approvals, these excess votes can be transferred to other candidates to prevent them from being wasted.[3] (As well, the equivalent of one quota is the number of votes not used to elect someone in many STV contests.)

The Droop quota was first suggested by the English lawyer and mathematician Henry Richmond Droop (1831–1884) as an alternative to the Hare quota[3] and later by Swiss physicist Eduard Hagenbach-Bischof in the context of STV and not for the largest remainder method.[3][4]

The Droop quota is used in almost all STV elections, including those in Australia,[5] the Republic of Ireland, Northern Ireland, and Malta.[6] It is also used in South Africa to allocate seats by the largest remainder method.[7][8] Switzerland uses the Droop quota, calling it the Hagenbach-Bischof quota.

Although common, the quota's use in proportional representation has been criticized both for its bias toward large parties[9] and for its ability to create no-show paradoxes, situations where a candidate or party loses a seat as a result of having won too many votes. However, this situation can occur regardless of whether the quota is used with largest remainders[10] or STV.[11] Charges of no-show paradoxes are based on having knowledge of how a vote would be transferred if a candidate were eliminated when that candidate may not have been in real life. It is clear that any system that uses ranked votes produces different results if candidates are in different order, which is partly determined by how votes are split and therefore that charge can apply to any ranked voting system no matter what quota is used. Some analysis states that no-show paradoxes are extremely rare in real-world elections.[12] For one thing, transfers have little effect in general on who is elected, the winners usually being among the front runners in the first round of counting anyway.[13]

Definition

The value of the exact Droop quota for a k-winner election is given by the expression:[1][14][15][16][17][18][19]Template:Excessive citations inline

total votesk+1

In the case of a single-winner election, this reduces to the familiar simple majority rule. Under such a rule, a candidate can be declared elected as soon as they have more than 50% of the vote, i.e. their vote total exceeds total votes2.[1] A candidate who, at any point, holds strictly more than one Droop quota's worth of votes is therefore guaranteed to win a seat.[20]Template:Efn

Sometimes, the Droop quota is written as a share of all votes, in which case it has value Template:Math.

Original Droop quota

The original Droop as devised by Henry Droop was one more than the exact Droop:

total votesk+1+1

Modern variants of STV use fractional transfers of ballots to eliminate uncertainty and therefore do not need to use the original whole-vote Droop quota. The original Droop quota is not necessary in elections that allow fractional transfers of ballots.

However, some older implementations of STV with whole vote reassignment did not use fractional votes and so instead either rounded up or added one and truncated:[3]

⌈total votesk+1⌉≈⌊total votesk+1+1⌋

This whole-vote variant of the quota is not necessary in the context of modern elections with fractional votes, and it can cause problems in small elections Template:Crossreference.[1][21] However, it is the most commonly used definition in legislative codes worldwide.Template:Citation needed

Derivation of the original Droop quota

The Droop quota was derived by considering what would happen if Template:Math candidates (here called "Droop winners") have achieved the Droop quota: could too many achieve quota? The goal was to identify whether an additional candidate could defeat any of the candidates who have quota. If each quota winner's share of the vote equals Template:Math, all unelected candidates' share of the vote, taken together, is at most Template:Math votes.

Thus, even if there were only one unelected candidate who held all the remaining votes, their vote tally would not exceed any of those with Droop quota.[3]

Example in STV

The following election has 3 seats to be filled by single transferable vote. There are 4 candidates: George Washington, Alexander Hamilton, Thomas Jefferson, and Aaron Burr. There are 102 voters, but two of the votes are spoiled.

The total number of valid votes is 100, and there are 3 seats. The exact Droop quota is therefore 1003+1=25.[17] These votes are as follows:

45 voters 20 voters 25 voters 10 voters
1 Washington Burr Jefferson Hamilton
2 Hamilton Jefferson Burr Washington
3 Jefferson Washington Washington Jefferson

First preferences for each candidate are tallied:

Only Washington has more than 25 votes. As a result, he is immediately elected. Washington has 20 excess votes that can be transferred to their second choice, Hamilton. The tallies therefore become:

Hamilton is elected, so his excess votes are redistributed. Thanks to Hamilton's support, Jefferson receives 30 votes to Burr's 20 and is elected.

If all of Hamilton's supporters had instead backed Burr, the election for the last seat would have been tied, requiring a tiebreaker. Generally, ties are broken by electing the candidate who had the most first preference votes, or taking the limit of the results as the quota approaches the exact Droop quota.

Varieties

The term Droop quota is frequently defined or understood in a variety of ways that can cause confusion as to what value legislators and political observers are referring.[4] At least six different versions appear in various legal codes or definitions of the quota, all varying by one vote.[4] The Electoral Reform Society handbook on STV has advised against such variants since at least 1976, as they can cause problems with proportionality in small elections.[1][21] In addition, it means that vote totals cannot be summarized into percentages because the winning candidate may depend on the choice of unit or total number of ballots (not just their distribution across candidates).[1][21] Common variants of the Droop quota include:

Historical:⌈votesseats+1⌉⌊votesseats+1+1⌋⌊votesseats+1⌋+1Accidental:⌊votes+1seats+1⌋⌊votesseats+1+1⌋Unusual:⌊votesseats+1⌋⌊votesseats+1+12⌋

The variants in the first line come from Droop's discussion in the context of Hare's STV proposal. Hare assumed that to calculate election results, physical ballots would be reshuffled across piles and did not consider the possibility of fractional votes. In such a situation, rounding the number of votes up (or, alternatively, adding one and rounding down)Template:Efn introduces as little error as possible, while maintaining the admissibility of the quota.[4][3]

Some believe the original form of the Droop quota is still needed in modern STV systems to prevent an extra candidate reaching quota than there are winners.[4] As Newland and Britton noted in 1974, this is not a problem: if the last two winners both receive a Droop quota of votes, rules can be applied to break the tie, and ties can occur regardless of which quota is used.[1][21] Due to perceived need for this extra safety measure, Ireland, Malta and Australia have used Droop's original quota, votesseats+1+1 , for the last hundred years.[1][21]

Comparison with Hare

The Droop quota is sometimes confused with the more intuitive Hare quota. While the Droop quota gives the number of votes needed to mathematically guarantee a candidate's election, the Hare quota gives the number of voters represented by each winner in an exactly proportional system (i.e. one where each vote is represented equally and every vote is used). Unfortunately, frequently one or more votes are found to be exhausted and there is no way for the last elected candidate to be elected with Hare.

According to some, the Hare quota gives more proportional outcomes on average because it is statistically unbiased.[9]

By contrast, the Droop quota is biased towards large parties.[9] Being smaller than Hare, it allows more parties to take two or more seats. The Droop quota may allow a party representing less than half of the voters to take a majority of seats.[9] However, the Droop quota has the advantage over Hare that any party receiving more than half the votes in a district will receive at least half of the seats in the district, while Hare quota sometimes denies that type of win to the leading party.

It can be shown that Droop produces more transferable votes following the announcement of the first-count winners, and these transfer are conducted prior to any elimination of candidates, so in certain cases, the use of the Droop quota ensures party's full slates are available longer. Under Hare, fewer votes are considered surplus so transfers are done quicker and candidates are eliminated sooner, thus potentially eliminating a candidate who, if they had survived, might have been elected as votes were transferred.[22]

See also

Notes

Template:Notelist

References

Template:Reflist

Sources

Further reading

Template:Voting systems Template:Majorities and quotas

  1. ↑ 1.0 1.1 1.2 1.3 1.4 1.5 1.6 1.7 Template:Cite journal
  2. ↑ Template:Citation
  3. ↑ 3.0 3.1 3.2 3.3 3.4 3.5 3.6 3.7 Template:Cite journal Reprinted in Voting matters Issue 24 (October 2007) pp. 7–46.
  4. ↑ 4.0 4.1 4.2 4.3 4.4 Template:Cite journal
  5. ↑ Template:Cite web
  6. ↑ Template:Cite web
  7. ↑ Template:Cite book
  8. ↑ Template:Cite web
  9. ↑ 9.0 9.1 9.2 9.3 Template:Citation
  10. ↑ Template:Cite journal
  11. ↑ Template:Cite journal
  12. ↑ Mohsin et al, Computational Complexity of Verifying the Group No-show Paradox. https://www.ijcai.org/proceedings/2024/0328.pdf accessed 20210-16
  13. ↑ Stephen Quinlan, "The transfers game A comparative analysis of the mechanical effect of lower preference votes in STV systems" https://journals.sagepub.com/doi/abs/10.1177/0192512120907925. accessed 2025-10-16
  14. ↑ Template:Cite book
  15. ↑ Template:Cite journal
  16. ↑ Template:Cite book
  17. ↑ 17.0 17.1 Template:Cite journal
  18. ↑ Template:Cite book
  19. ↑ Template:Citation
  20. ↑ Template:Cite book
  21. ↑ 21.0 21.1 21.2 21.3 21.4 Template:Cite journal
  22. ↑ Lakeman and Lambert, Voting in Democracies, pg. 129-131