Optimal apportionment explained

Optimal apportionment is an approach to apportionment that is based on mathematical optimization.

In a problem of apportionment, there is a resource to allocate, denoted by

h . For example, it can be an integer representing the number of seats in a house of representatives. The resource should be allocated between some n agents. For example, these can be federal states or political parties. The agents have different entitlements, denoted by a vector of fractions t _{1,\ldots,t} _{n} with a sum of 1. For example, t_i can be the fraction of votes won by party i. The goal is to find an allocation - a vector a _{1,\ldots,a} _{n} with \sum ^{n} _{i =1} a _{i} = h .

The ideal share for agent i is his/her quota, defined as

q _{i} : = t _{i ⋅} h . If it is possible to give each agent his/her quota, then the allocation is maximally fair. However, exact fairness is usually unattainable, since the quotas are not integers and the allocations must be integers. There are various approaches to cope with this difficulty (see mathematics of apportionment). The optimization-based approach aims to attain, for eacn instance, an allocation that is "as fair as possible" for this instance. An allocation is "fair" if a _{i} = q _{i} for all agents i, that is, each agent's allocation is exactly proportional to his/her entitlement. in this case, we say that the "unfairness" of the allocation is 0. If this equality must be violated, one can define a measure of "total unfairness", and try to minimize it.

Minimizing the sum of unfairness levels

The most natural measure is the sum of unfairness levels for individual agents, as in the utilitarian rule:

• One can minimize the sum of differences

\sum ^{n} _{i =1} |a _{i} - q _{i|} , or the sum of squares \sum ^{n} _{i =1} (a _{i} - q ^{2} _{i)} , which weight every state (or party) equally. Both minimization problems are solved by Hamilton's method.\sum ^{n} _{i =1} q _{i} (a _{i/q} _{i} - 1 ) ^{2} . This leads to Webster's method.

• One can weight the elements in the sum by the allocations, and try to minimize

\sum ^{n} _{i =1} a _{i} (q _{i/a} _{i} - 1 ) ^{2} . This leads to Hill's method.

Minimizing the largest unfairneses

One can minimize the largest unfairness, as in the egalitarian rule:

• One can minimize

max ^{n} _{i =1} |q _{i} / a _{i} - 1 | , and proceed to minimize the next-largest unfairness etc., using the leximin order. This yields a method called the leximin apportionment method. It was first developed by Biro, Koczy and Sziklai, who presented an efficient algorithm to compute it. Its main goal is to satisfy the requirement of the Venice Commission that the maximum departure from equal distribution of items among agents should be as small as possible. Its disadvantage is that it violates the quota rule and all monotonicity criteria.

• Burt and Harris (1963) suggested to minimize

max ^{n} _{i,j =1} |q _{i} / a _{i} - q _{j/a} _{j|} .^[1]

• Minimizing

max ^{n} _{i =1} q _{i/a} _{i} leads to Adams's method.

• Minimizing

max ^{n} _{i =1} a _{i/q} _{i} leads to Jefferson's method.

• It is also possible to maximize

min ^{n} _{i =1} (a _{i} - q _{i)} , or equivalently, minimize max ^{n} _{i =1} (q _{i} - a _{i)} . This method satisfies both quotas.

• The minimax method can be generalized to any chosen priority ordering on the fairness criteria.

Notes and References

1. Burt . Oscar R. . Harris . Curtis C. . August 1963 . Letters to the editor . 10.1287/opre.11.4.648 . 4 . Operations Research . 648-652 . Institute for Operations Research and the Management Sciences (INFORMS) . Apportionment of the U.S. House of Representatives: A Minimum Range, Integer Solution, Allocation Problem . 11.