{
  "id": "enwiki-001374426926",
  "slug": "highest-averages-method",
  "title": "Highest averages method",
  "qid": "",
  "lead": "The highest averages, divisor, or divide-and-round methods are a family of apportionment rules, i.e. algorithms for fair division of seats in a legislature between several groups (like political parties or states). More generally, divisor methods are used to round shares of a total to a fraction with a fixed denominator (e.g. percentage points, which must add up to 100). The methods aim to treat voters equally by ensuring legislators represent an equal number of voters by ensuring every party has the same seats-to-votes ratio (or divisor). Such methods divide the number of votes by the number of votes per seat to get the final apportionment. By doing so, the method maintains proportional representation, as a party with e.g. twice as many votes will win about twice as many seats. The divisor methods are generally preferred by social choice theorists and mathematicians to the largest remainder methods, as they produce more-proportional results by most metrics and are less susceptible to apportionment paradoxes. In particular, divisor methods avoid the population paradox and spoiler effects, unlike the largest remainder methods.",
  "body": "The highest averages, divisor, or divide-and-round methods are a family of apportionment rules, i.e. algorithms for fair division of seats in a legislature between several groups (like political parties or states). More generally, divisor methods are used to round shares of a total to a fraction with a fixed denominator (e.g. percentage points, which must add up to 100). The methods aim to treat voters equally by ensuring legislators represent an equal number of voters by ensuring every party has the same seats-to-votes ratio (or divisor). Such methods divide the number of votes by the number of votes per seat to get the final apportionment. By doing so, the method maintains proportional representation, as a party with e.g. twice as many votes will win about twice as many seats. The divisor methods are generally preferred by social choice theorists and mathematicians to the largest remainder methods, as they produce more-proportional results by most metrics and are less susceptible to apportionment paradoxes. In particular, divisor methods avoid the population paradox and spoiler effects, unlike the largest remainder methods. \\text{seats} = \\operatorname{round}\\left(\\frac{\\text{votes}}{\\text{divisor}}\\right) Usually, it is initially set to equal the Hare quota. However, this procedure may assign too many or too few seats. In this case the apportionments for each party will not add up to the total legislature size. A feasible divisor can be found by trial and error. Given that the divisor is some approximation of the ratio of total votes to total seats, this operation can be viewed as varying that total number of seats and letting the rounding compensate it back to the actual legislature size. \\text{average} := \\frac{\\text{votes}}{\\operatorname{post}(\\text{seats})} ===D'Hondt (Jefferson) method=== Thomas Jefferson was the first to propose a divisor method, in 1792; it was later independently developed by Belgian political scientist Victor d'Hondt in 1878. It assigns the representative to the list that would be most underrepresented at the end of the round. It remains the most-common method for proportional representation to this day. The D'Hondt method uses the sequence \\operatorname{post}(k) = k+1 , i.e. (1, 2, 3, ...), which means it will always round a party's apportionment down. An apportionment under the D'Hondt method never falls below the lower end of the ideal frame, and it minimizes the worst-case overrepresentation in the legislature. However, it performs poorly when judged by most other metrics of proportionality. The rule typically gives large parties an excessive number of seats, with their seat share often exceeding their entitlement rounded up. This pathology led to widespread mockery of the D'Hondt method when it was learned the D'Hondt method could \"round\" New York's apportionment of 40.5 up to 42, with Senator Mahlon Dickerson saying the extra seat must come from the \"ghosts of departed representatives\". ===Adams' method=== Adams' method was conceived of by John Quincy Adams after noticing the D'Hondt method allocated too few seats to smaller states. It can be described as the inverse of the D'Hondt method; it awards a seat to the party that has the most votes per seat before the new seat is added. The divisor function is , which is equivalent to always rounding up. Adams' apportionment never exceeds the upper end of the ideal frame, and minimizes the worst-case underrepresentation. However, like the D'Hondt method, Adams' method performs poorly according to most metrics of proportionality. It also often violates the lower seat quota. Adams' method was suggested as part of the Cambridge compromise for apportionment of European parliament seats to member states, with the aim of satisfying degressive proportionality. ===Webster/Sainte-Laguë (Schepers) method=== The Webster/Sainte-Laguë method was first described in 1832 by American statesman and senator Daniel Webster and later independently in 1910 by the French mathematician André Sainte-Laguë. In 1980 the German physicist Hans Schepers, at the time Head of the Data Processing Group of the Bundestag, suggested that the distribution of seats according to the D'Hondt method be modified to avoid putting smaller parties at a disadvantage. German media started using the term Schepers Method and later German literature usually calls it Sainte-Laguë/Schepers. The Webster/Sainte-Laguë method uses the fencepost sequence (i.e. 0.5, 1.5, 2.5); this corresponds to the standard rounding rule. Equivalently, the odd integers (1, 3, 5...) can be used to calculate the averages instead; the odd-number expression is more common in electoral laws. The Webster/Sainte-Laguë method shows a more equal seats-to-votes ratio for different sized parties among apportionment methods; it produces more proportional apportionments than D'Hondt by almost every metric of misrepresentation. As such, it is typically preferred to D'Hondt by political scientists and mathematicians, at least in situations where manipulation is difficult or unlikely (as in large parliaments). It is also notable for minimizing seat bias even when dealing with parties that win very small numbers of seats. The Webster/Sainte-Laguë method can theoretically violate the ideal frame, although this is extremely rare for even moderately-large parliaments; it has never been observed to violate quota in any United States congressional apportionment. In small districts with no threshold, parties can manipulate the Webster/Sainte-Laguë method by splitting into many lists, each of which wins a full seat with less than a Hare quota's worth of votes. This is often addressed by modifying the first divisor to be slightly larger (often a value of 0.7 or 1 instead of 0.5, equal to 1.4 or 2 instead of 1), which creates an implicit threshold. ==Comparison and examples== === Example: D'Hondt=== The following example shows how the D'Hondt method can differ substantially from less-biased methods such as Webster/Sainte-Laguë. In this election, the largest party wins 46% of the vote, but takes 52.5% of the seats, enough to win a majority outright against a coalition of all other parties (which together reach 54% of the vote). Moreover, it does this in violation of quota: the largest party is entitled only to 9.7 seats, but it wins 11 regardless. The largest congressional district is nearly twice the size of the smallest district. The Webster/Sainte-Laguë method shows none of these properties, with a maximum error of 22.6%. ==== Stationary family ==== A divisor method is called stationary if for some real number r\\in[0,1] , its signposts are of the form d(k) = k+r . The Adams, Webster/Sainte-Laguë, and d'Hondt methods are stationary, while Dean and Huntington–Hill are not. A stationary method corresponds to rounding numbers up if they exceed the weighted arithmetic mean of and . Smaller values of are friendlier to smaller parties. Danish elections allocate leveling seats at the province level using-member constituencies. It divides the number of votes received by a party in a multi-member constituency by 0.33, 1.33, 2.33, 3.33 etc. The fencepost sequence is given by ; this aims to allocate seats closer to equally, rather than exactly proportionally. ==== Power mean family ==== The power mean family of divisor methods includes the Adams, Huntington–Hill, Webster/Sainte-Laguë, Dean, and D'Hondt methods (either directly or as limits). For a given constant , the power mean method has signpost function . The Huntington–Hill method corresponds to the limit as tends to 0, while Adams and D'Hondt represent the limits as tends to negative or positive infinity. The family also includes the less-common Dean's method for , which corresponds to the harmonic mean. Dean's method is equivalent to rounding to the nearest average—every state has its seat count rounded in a way that minimizes the difference between the average district size and the ideal district size. For example: The 1830 representative population of Massachusetts was 610,408: if it received 12 seats its average constituency size would be 50,867; if it received 13 it would be 46,954. So, if the divisor were 47,700 as Polk proposed, Massachusetts should receive 13 seats because 46,954 is closer to 47,700 than is 50,867. Rounding to the vote average with the smallest relative error once again yields the Huntington–Hill method because , i.e. relative differences are reversible. This fact was central to Edward V. Huntington's use of relative (instead of absolute) errors in measuring misrepresentation, and to his advocacy for Hill's rule: Huntington argued the choice of apportionment method should not depend on how the equation for equal representation is rearranged, and only the relative error (minimized by Hill's rule) satisfies this property. ==References==",
  "categories": [
    "101202739",
    "116690197",
    "127661156",
    "22958411",
    "23584436",
    "23603337",
    "24043274",
    "24623845",
    "26220375",
    "40397372",
    "51981521",
    "66806678",
    "68328988",
    "90415139"
  ],
  "license": "CC BY-SA 4.0",
  "source_uri": "https://en.wikipedia.org/w/index.php?oldid=1374426926",
  "content_hash": "",
  "created_at": null,
  "updated_at": 1789166216.0,
  "claims": [],
  "contradictions": [],
  "confidence": 0.6,
  "csl": {
    "id": "enwiki-001374426926",
    "type": "webpage",
    "title": "Highest averages method",
    "author": [
      {
        "family": "Anticloud FZ LLE",
        "literal": "Anticloud FZ LLE"
      }
    ],
    "container-title": "encyclopegia.org",
    "publisher": "Anticloud FZ LLE",
    "publisher-place": "Dubai, United Arab Emirates",
    "URL": "https://encyclopegia.org/a/highest-averages-method",
    "issued": {
      "date-parts": [
        [
          2026,
          11,
          20
        ]
      ]
    },
    "accessed": {
      "date-parts": [
        [
          2026,
          11,
          20
        ]
      ]
    },
    "license": "CC BY-SA 4.0",
    "DOI": "eo1:enwiki-001374426926",
    "isBasedOn": "https://en.wikipedia.org/w/index.php?oldid=1374426926",
    "note": "Immutable snapshot enwiki-001374426926"
  }
}