A joint Politics and Economics series |
Social choice and electoral systems |
---|
Mathematics portal |
In mathematics and social choice, apportionment problems are a class of fair division problems where the goal is to divide (apportion) a whole number of identical goods fairly between multiple groups with different entitlements. The original example of an apportionment problem involves distributing seats in a legislature between different federal states or political parties.[1] However, apportionment methods can be applied to other situations as well, including bankruptcy problems,[2] inheritance law (e.g. dividing animals),[3][4] manpower planning (e.g. demographic quotas),[5] and rounding percentages.[6]
Mathematically, an apportionment method is just a method of rounding real numbers to integers. Despite the simplicity of this problem, every method of rounding suffers one or more paradoxes, as proven by the Balinski-Young theorem. The mathematical theory of apportionment identifies what properties can be expected from an apportionment method.
The mathematical theory of apportionment was studied as early as 1907 by the mathematician Agner Krarup Erlang.[citation needed] It was later developed to a great detail by the mathematician Michel Balinski and the economist Peyton Young.[7]