Biproportional apportionment


Biproportional apportionment is a proportional representation method to allocate seats in proportion to two separate characteristics. That is, for two different partitions each part receives the proportional number of seats within the total number of seats. For instance, this method could give proportional results by party and by region, or by party and by gender/ethnicity, or by any other pair of characteristics.
  1. Example: proportional by party and by region
  2. * Each party's share of seats is proportional to its total votes.
  3. * Each region's share of seats is proportional to its total votes
  4. **.
  5. Then, as nearly as possible given the totals for each region and each party:
  6. * Each region's seats are allocated among parties in proportion to that region's votes for those parties.
  7. * Each party's seats are allocated among regions in proportion to that party's votes in those regions.

    Process

Suppose that the method is to be used to give proportional results by party and by region.
Each party nominates a candidate list for every region. The voters vote for the parties of their region.
The results are calculated in two steps:
This can be seen as globally adjusting the voting power of each party's voters by the minimum amount necessary so that the region-by-region results become proportional by party.

Upper apportionment

In the upper apportionment the seats for each party are computed with a highest averages method. This determines how many of all seats each party deserves due to the total of all their votes. Analogical, the same highest averages method is used to determine how many of all seats each region deserves.
Note, that the results from the upper apportionment are final results for the number of the seats of one party within the whole voting area, the lower apportionment will only determine in which particular regions the party seats are allocated. Thus, after the upper apportionment is done, the final strength of a party/region within the parliament is definite.

Lower apportionment

The lower apportionment has to distribute the seats to each regional party list in a way that respects both the apportionment of seats to the party and the apportionment of seats to the regions.
The result is obtained by an iterative process. Initially, for each region a regional divisor is chosen using the highest averages method for the votes allocated to each regional party list in this region. For each party a party divisor is initialized with 1.
Effectively, the objective of the iterative process is to modify the regional divisors and party divisors so that
The following two correction steps are executed until this objective is satisfied:
Using the Sainte-Laguë method, this iterative process is guaranteed to terminate with appropriate seat numbers for each regional party list.

Specific Example

Suppose there are three parties A, B and C and three regions I, II and III and that there are 20 seats are to be distributed and that the Sainte-Laguë method is used. The votes for the regional party lists are as follows:

Upper apportionment

For the upper apportionment, the overall seat number for the parties and the regions are determined.
Since there are 3805 voters and 20 seats, there are 190 voters per seat. Thus the results for the distribution of the party seats is:
PartyABC
#votes9832040782
#votes/divisor5.210.74.1
#seats5114

Using the divisor 190, the results for the distribution of the region seats is:
RegionIIIIII
#votes134710141444
#votes/divisor7.15.37.6
#seats758

Lower apportionment

Initially, regional divisors have to be found to distribute the seats of each region to the regional party lists. In the tables, for each regional party list, there are two cells, the first shows the number of votes and the second the number of seats allocated.
Now, the party divisors are initialized with ones and the number of seats within each party is checked :
Since not all parties have the correct number of seats, a correction step have to be executed: For parties A and B, the divisors are to be adjusted. The divisor for A has to be raised and the divisor for B has to be lowered:
Now, the divisors for regions I and III have to be modified. Since region I has one seat too much, its divisor has to be raised; in opposite, the divisor for region III has to be lowered.
Again, the divisors for the parties have to be adjusted:
Now, the numbers of seats for the three parties and the three regions match the numbers computed in the upper apportionment. Thus, the iterative process is completed.
The final seat numbers are:

Usage

The method was proposed in 2003 by German mathematician Friedrich Pukelsheim. It is used for cantonal and municipal elections in some cantons of Switzerland, i.e. Zurich, Aargau and Schaffhausen, Nidwalden, Zug, Schwyz and Valais.

Fair majority voting

Fair majority voting is a biproportional apportionment method with single-member regions called "districts", so each district has exactly one representative. It was proposed in 2008 by Michel Balinski as a way to eliminate the power of gerrymandering, especially in the United States.