Part of the Politics series 
Electoral systems 


A highestaverages method, also called a divisor method, is a class of methods for allocating seats in a parliament among agents such as political parties or federal states. A divisor method is an iterative method: at each iteration, the number of votes of each party is divided by its divisor, which is a function of the number of seats (initially 0) currently allocated to that party. The next seat is allocated to the party whose resulting ratio is largest.^{[1]}
The inputs to a divisor method are the number of seats to allocate, denoted by h, and the vector of parties' entitlements, where the entitlement of party is denoted by (a number between 0 and 1 determining the fraction of seats to which is entitled). Assuming all votes are counted, is simply the number of votes received by , divided by the total number of votes.
A divisor method is parametrized by a function , mapping each integer to a real number (usually in the range ) .
The number of seats allocated to party is denoted by . Initially, is set to 0 for all parties. Then, at each iteration, the next seat is allocated to a party which maximizes the ratio . The method proceeds for h iterations, until all seats are allocated.
An equivalent definition directly gives the outcome of the divisor method as follows.
For an election, a quotient is calculated, usually the total number of votes divided by the number of seats to be allocated (the Hare quota). Parties are then allocated seats by determining how many quotients they have won, by dividing their vote totals by the quotient. Where a party wins a fraction of a quotient, this can be rounded down or rounded to the nearest whole number. Rounding down is equivalent to using the D'Hondt method, while rounding to the nearest whole number is equivalent to the SainteLaguë method. Rounding up is equivalent to using Adams's method. However, because of the rounding, this will not necessarily result in the desired number of seats being filled. In that case, the quotient may be adjusted up or down until the number of seats after rounding is equal to the desired number.
The tables used in the D'Hondt or SainteLaguë methods can then be viewed as calculating the highest quotient possible to round off to a given number of seats. For example, the quotient which wins the first seat in a D'Hondt calculation is the highest quotient possible to have one party's vote, when rounded down, be greater than 1 quota and thus allocate 1 seat. The quotient for the second round is the highest divisor possible to have a total of 2 seats allocated, and so on.
Formally, given the vector of entitlements and housesize , a divisor method can be defined as:
where the method of rounding is defined by the divisor function d.
Every divisor method can be defined using a minmax inequality: a is an allocation for the divisor method with divisor d, ifandonlyif^{[2]}^{: 78–81 }
.
Every number in the range is a possible divisor. If the range is not a singleton (that is, the inequality is strict), then the solution is unique; otherwise (the inequality is an equality), there are multiple solutions.^{[2]}^{: 83 }
Method  Divisor d(k) 
Rounding of Seats 
First values (approx.) 

Adam's  k  Up  0.00 1.00 2.00 3.00 
Danish  k + 1⁄3  0.33 1.33 2.33 3.33  
Dean's  k(k+1)/(k + 1⁄2) = 2÷(1⁄k + 1⁄k+1) 
Harmonic  0.00 1.33 2.40 3.43 
Huntington– Hill 
√k(k + 1)  Geometric  0.00 1.41 2.45 3.46 
Webster / SainteLaguë 
k + 1⁄2  Arithmetic  0.50 1.50 2.50 3.50 
D'Hondt / Jefferson 
k + 1  Down  1.00 2.00 3.00 4.00 
Imperiali  k + 2  2.00 3.00 4.00 5.00 
The methods have different properties, as explained in the following.
The Imperiali highest average method (not to be confused with the Imperiali quota which is a Largest remainder method) has divisors 1, 1.5, 2, 2.5, 3, 3.5 etc., or equivalently 2, 3, 4, 5, etc., corresponding to a divisor function . It is designed to disfavor the smallest parties, akin to a "cutoff", and is used only in Belgian municipal elections. This method (unlike other listed methods) is not strictly proportional: if a perfectly proportional allocation exists, it is not guaranteed to find it.
The most widely used divisor sequence is 1, 2, 3, 4, etc., corresponding to the divisor function . It is called the D'Hondt formula.^{[3]} This system tends to give larger parties a slightly larger portion of seats than their portion of the electorate, and thus guarantees that a party with a majority of voters will get at least half of the seats.
The Webster/SainteLaguë method divides the number of votes for each party by the odd numbers (1, 3, 5, 7 etc.), or equivalently by 0.5, 1.5, 2.5, 3.5 etc. It corresponds to a divisor function .
It is sometimes considered more proportional than D'Hondt in terms of a comparison between a party's share of the total vote and its share of the seat allocation though it can lead to a party with a majority of votes winning fewer than half the seats. This system is more favourable to smaller parties than D'Hondt's method, and thus it encourages splits.
The Webster/SainteLaguë method is sometimes modified by increasing the first divisor from 1 to e.g. 1.4, to discourage very small parties gaining their first seat "too cheaply".
In the Huntington–Hill method, the divisor function is , which makes sense only if every party is guaranteed at least one seat: this effect can be achieved by disqualifying parties receiving fewer votes than a specified number of votes, be it a percentage threshold or a quota such as Hare, Droop, or Imperiali. This method is used for allotting seats in the US House of Representatives among the states. Because squaring does not change the order of the computed ratios, the square root involved in comparing values can be avoided by instead comparing values.
The Danish method is used in Danish elections to allocate each party's compensatory seats (or levelling seats) at the electoral province level to individual multimember constituencies. It divides the number of votes received by a party in a multimember constituency by the divisors growing by step equal to 3 (1, 4, 7, 10, etc.). Alternatively, dividing the votes numbers by 0.33, 1.33, 2.33, 3.33 etc. yields the same result. The divisor function is . This system purposely attempts to allocate seats equally rather than proportionately.^{[4]}
Adams's method was conceived by John Quincy Adams for apportioning seats of the House to states.^{[5]} He perceived Jefferson's method to allocate too few seats to smaller states. It can be described as the inverse of Jefferson's method; it awards a seat to the party that has the most votes per seat before the seat is added. The divisor function is .^{[6]}
Like the HuntingtonHill method, this results in a value of 0 for the first seats to be appointed for each party, resulting in an average of ∞. It can only violate the lower quota rule.^{[7]} This occurs in the example below.
Without a threshold, all parties that have received at least one vote, also receive a seat, with the obvious exception of cases where there are more parties than seats. This property can be desirable, for example when apportioning seats to electoral districts. As long as there are at least as many seats as districts, all districts are represented. In a partylist proportional representation election, it may result in very small parties receiving seats. Furthermore, quota rule violations in the pure Adams's method are very common.^{[8]} These problems may be solved by introducing an electoral threshold.^{[6]}
In the following example, the total vote is 100,000. There are 10 seats. The number at each cell in the "pink" table denotes the number of votes divided by the corresponding divisor . For example, for D'Hondt's method, in the row , the numbers are just the parties' votes (divided by ). In the row , the numbers are the votes divided by 2. For the SaintLague method, in the row , the numbers are the votes divided by 3 (the second element in the sequence of divisors), and so on.
D'Hondt method  SainteLaguë method
(unmodified: sequence 1,3,5,7...) 
SainteLaguë method
(modified: sequence 1.4,3,5,7...) 
Huntington–Hill method^{[a]}  Pure Adams's method  Adams's method
with threshold = 1  

party  Yellow  White  Red  Green  Blue  Pink  Yellow  White  Red  Green  Blue  Pink  Yellow  White  Red  Green  Blue  Pink  Yellow  White  Red  Green  Blue  Pink  Yellow  White  Red  Green  Blue  Pink  Yellow  White  Red  Green  Blue  Pink 
votes  47,000  16,000  15,900  12,000  6,000  3,100  47,000  16,000  15,900  12,000  6,000  3,100  47,000  16,000  15,900  12,000  6,000  3,100  47,000  16,000  15,900  12,000  6,000  3,100  47,000  16,000  15,900  12,000  6,000  3,100  47,000  16,000  15,900  12,000  6,000  3,100 
seats  5  2  2  1  0  0  4  2  2  1  1  0  5  2  2  1  0  0  5  2  2  1  0  0  3  2  2  1  1  1  4  2  2  2  0  0 
votes/seat  9,400  8,000  7,950  12,000  11,750  8,000  7,950  12,000  6,000  9,400  8,000  7,950  12,000  9,400  8,000  7,950  12,000  15,667  8,000  7,950  12,000  6,000  3,100  11,750  8,000  7,950  6,000  
quotient  
0  47,000  16,000  15,900  12,000  6,000  3,100  47,000  16,000  15,900  12,000  6,000  3,100  33,571  11,429  11,357  8,571  4,286  2,214  ∞  ∞  ∞  ∞  excluded  ∞  ∞  ∞  ∞  ∞  ∞  ∞  ∞  ∞  ∞  excluded  
1  23,500  8,000  7,950  6,000  3,000  1,550  15,667  5,333  5,300  4,000  2,000  1,033  15,667  5,333  5,300  4,000  2,000  1,033  33,234  11,314  11,243  8,485  47,000  16,000  15,900  12,000  6,000  3,100  47,000  16,000  15,900  12,000  
2  15,667  5,333  5,300  4,000  2,000  1,033  9,400  3,200  3,180  2,400  1,200  620  9,400  3,200  3,180  2,400  1,200  620  19,187  6,531  6,491  4,898  23,500  8,000  7,950  6,000  3,000  1,550  23,500  8,000  7,950  6,000  
3  11,750  4,000  3,975  3,000  1,500  775  6,714  2,857  2,271  1,714  875  443  6,714  2,857  2,271  1,714  875  443  13,567  4,618  4,589  3,464  15,667  5,333  5,300  4,000  2,000  1,033  15,667  5,333  5,300  4,000  
4  9,400  3,200  3,180  2,400  1,200  620  5,222  1,778  1,767  1,333  667  333  5,222  1,778  1,767  1,333  667  333  10,509  3,577  3,555  2,683  11,750  4,000  3,975  3,000  1,500  775  11,750  4,000  3,975  3,000  
5  7,833  2,667  2,650  2,000  1,000  517  4,273  1,454  1,445  1,091  545  282  4,273  1,454  1,445  1,091  545  282  8,580  2,921  2,902  2,190  9,400  3,200  3,180  2,400  1,200  620  9,400  3,200  3,180  2,400  
seat  seat allocation  
1  47,000  47,000  33,571  ∞  excluded  ∞  ∞  excluded  
2  23,500  16,000  15,667  ∞  ∞  ∞  
3  16,000  15,900  11,429  ∞  ∞  ∞  
4  15,900  15,667  11,357  ∞  ∞  ∞  
5  15,667  12,000  9,400  33,234  ∞  47,000  
6  12,000  9,400  8,571  19,187  ∞  23,500  
7  11,750  6,714  6,714  13,567  47,000  16,000  
8  9,400  6,000  5,333  11,314  23,500  15,900  
9  8,000  5,333  5,300  11,243  16,000  15,667  
10  7,950  5,300  5,222  10,509  15,900  12,000 
As can be seen in the example, D'Hondt, SainteLaguë and HuntingtonHill allow different strategies by parties looking to maximize their seat allocation. D'Hondt and Huntington–Hill can favor the merging of parties, while SainteLaguë can favor splitting parties (modified SaintLaguë reduces the splitting advantage).
In these examples, under D'Hondt and Huntington–Hill the Yellows and Greens combined would gain an additional seat if they merged, while under SainteLaguë the Yellows would gain if they split into six lists with about 7,833 votes each.
All divisor methods satisfy the basic properties of anonymity, balance, concordance, exactness and completeness.
All the divisor methods satisfy house monotonicity. This means that, when the number of seats in the parliament increases, no party loses a seat.^{[9]}^{: Cor.4.3.1 } This is evident from the iterative description of the methods: when a seat is added, the initial process remains the same, it just proceeds to an additional iteration. In other words, divisor methods avoid the Alabama paradox.
Moreover, all divisor methods satisfy pairwise population monotonicity. This means that, if the number of votes of one party increases in a faster rate than the number of votes of another party, then it does not happen that the first party loses seats while the second party gains seats. Moreover, the divisor methods are provably the only methods satisfying this form of monotonicity.^{[9]}^{: Thm.4.3 } In other words, divisor methods are the only ones avoiding the population paradox.
On the negative side, divisor methods might violate the quota rule: they might give some agents less than their lower quota (quota rounded down) or more than their upper quota (quota rounded up). This can be fixed by using quotacapped divisor methods (see below).
Simulation experiments^{[10]} show that different divisor methods have greatly different probabilities of violating quota (when the number of votes is selected by an exponential distribution):
A divisor method is called stationary^{[11]}^{: 68 } if its divisor is of the form for some real number . The methods of Adams, Webster and DHondt are stationary, while those of Dean and HuntingtonHill are not.
A quotacapped divisor method is an apportionment method in which the next seat is allocated only to a party from a set of eligible parties. Eligible parties should satisfy two conditions:
Formally, in each iteration (corresponding to allocating the th seat), the following sets are computed (see mathematics of apportionment for the definitions and notation):
The th seat is given to a party for which the ratio is largest.
The BalinskyYoung quota method^{[12]} is the quotacapped variant of the D'Hondt method (also called: QuotaJefferson). Similarly, one can define the QuotaWebster, QuotaAdams, etc.^{[13]}
Every quotacapped divisor method satisfies housemonotonicity. If eligibility is based on quotas as above, then the quotacapped divisor method satisfies upper quota by definition, and it can be proved that it satisfies lower quota as well.^{[14]}^{: Thm.7.1 }
However, quotacapped divisor methods might violate a property of population monotonicity: it is possible that some party i wins more votes, while all other parties win the same number of votes, but party i loses a seat.^{[14]}^{: Tbl.A7.2 }^{[15]} This could happen when, due to party i getting more votes, the upper quota of some other party j decreases. Therefore, party j is not eligible to a seat in the current iteration, and some third party receives the next seat. But then, at the next iteration, party j is again eligible to a seat, and it beats party i. There are similar examples for all quotacapped divisor methods.
A rankindex methods^{[16]}^{: Sec.8 } is a generalization of a divisor method. Another term is a Huntington method,^{[17]} since it generalizes an idea by Edward Vermilye Huntington.
Like all apportionment methods, the inputs of any rankindex method are:
Its output is a vector of integers with , called an apportionment of , where is the number of items allocated to agent i.
Every rankindex method is parametrized by a rankindex function , which is increasing in the entitlement and decreasing in the current allocation . The apportionment is computed iteratively as follows:
Divisor methods are a special case of rankindex methods: a divisor method with divisor function is equivalent to a rankindex method with rankindex function .
Every rankindex method can be defined using a minmax inequality: a is an allocation for the rankindex method with function r, ifandonlyif:^{[16]}^{: Thm.8.1 }
.
Every rankindex method is housemonotone. This means that, when increases, the allocation of each agent weakly increases. This immediately follows from the iterative procedure.
Every rankindex method is uniform. This means that, we take some subset of the agents , and apply the same method to their combined allocation , then the result is exactly the vector . In other words: every part of a fair allocation is fair too. This immediately follows from the minmax inequality.
Moreover: