Editing Highest averages method (section)

=== Highest averages procedure ===
With the highest averages algorithm, every party begins with 0 seats. Then, at each iteration, we allocate a seat to the party with the ''highest vote average,'' i.e. the party with the most [[Seats-to-votes ratio|votes per seat]]''.'' This method proceeds until all seats are allocated.<ref name="Pukelsheim-2017-1" />

However, it is unclear whether it is better to look at the vote average ''before'' assigning the seat, what the average will be ''after'' assigning the seat, or if we should compromise with a [[continuity correction]]. These approaches each give slightly different apportionments.<ref name="Pukelsheim-2017-1" /> In general, we can define the averages using the signpost sequence:

<math>\text{average} := \frac{\text{votes}}{\operatorname{post}(\text{seats})}</math>

With the highest averages procedure, every party begins with 0 seats. Then, at each iteration, we allocate a seat to the party with the ''highest vote average,'' i.e. the party with the most votes per seat''.'' This method proceeds until all seats are allocated.<ref name="Pukelsheim-2017-1" />