Seat bias

Last updated

Seat bias is a property describing methods of apportionment. These are methods used to allocate seats in a parliament among federal states or among political parties. A method is biased if it systematically favors small parties over large parties, or vice versa. There are various ways to compute the bias of apportionment methods.

Contents

When the agents are federal states, it is particularly important to avoid bias between large states and small states. There are several ways to measure this bias formally.

Notation

There is a positive integer (=house size), representing the total number of seats to allocate. There is a positive integer representing the number of parties to which seats should be allocated. There is a vector of fractions with , representing entitlements - represents the entitlement of party , that is, the fraction of seats to which is entitled (out of the total of ). This is usually the fraction of votes that this party has won in the elections.

The goal is to find an apportionment method is a vector of integers with , called an apportionment of , where is the number of seats allocated to party i.

An apportionment method is a multi-valued function , which takes as input a vector of entitlements and a house-size, and returns as output an apportionment of .

Pairwise comparison of methods

We say that an apportionment method favors small parties more than if, for every t and h, and for every and , implies either or .

If and are two divisor methods with divisor functions and , and whenever , then favors small agents more than . [1] :Thm.5.1 Therefore, Adams' method favors small parties more than Dean's, more than Hill's, more than Webster's, more than Jefferson's.

This fact can be expressed using the majorization ordering on integer vectors. A vector a seats majorizes another vector b, if for all k, the k largest parties receive in a at least as many seats as they receive in b. An apportionment method majorizes another method , if for any house-size and entitlement-vector, majorizes . If and are two divisor methods with divisor functions and , and whenever , then majorizes . Therefore, Adams' is majorized by Dean's, majorized by Hill's, majorized by Webster's, majorized by Jefferson's. [2]

The shifted-quota method (largest-remainders method) with quota are also ordered by majorization, where methods with smaller s are majorized by methods with larger s. [2]

Counting over all house sizes

To measure the bias of a certain apportionment method M, one can check, for each pair of entitlements , the set of all possible apportionments yielded by M, for all possible house sizes. Theoretically, the number of possible house sizes is infinite, but since are usually rational numbers, it is sufficient to check the house sizes up to the product of their denominators. For each house size, one can check whether or . If the number of house-sizes for which equals the number of house-sizes for which , then the method is unbiased. The only unbiased method, by this definition, is Webster's method. [1] :Prop.5.2

Averaging over all entitlement-pairs

One can also check, for each pair of possible allocations , the set of all entitlement-pairs for which the method M yields the allocations (for ). Assuming the entitlements are distributed uniformly at random, one can compute the probability that M favors state 1 vs. the probability that it favors state 2. For example, the probability that a state receiving 2 seats is favored over a state receiving 4 seats is 75% for Adams, 63.5% for Dean, 57% for Hill, 50% for Webster, and 25% for Jefferson. [1] :Prop.5.2 The unique proportional divisor method for which this probability is always 50% is Webster. [1] :Thm.5.2 There are other divisor methods yielding a probability of 50%, but they do not satisfy the criterion of proportionality as defined in the "Basic requirements" section above. The same result holds if, instead of checking pairs of agents, we check pairs of groups of agents. [1] :Thm.5.3

Averaging over all entitlement-vectors

One can also check, for each vector of entitlements (each point in the standard simplex), what is the seat bias of the agent with the k-th highest entitlement. Averaging this number over the entire standard simplex gives a seat bias formula.

For divisor methods

For each divisor method with divisor , where there is an electoral threshold : [3] :Sub.7.10

In particular, Webster's method is the only unbiased one in this family. The formula is applicable when the house size is sufficiently large, particularly, when . When the threshold is negligible, the third term can be ignored. Then, the sum of mean biases is:

, when the approximation is valid for .

Since the mean bias favors large parties when , there is an incentive for small parties to form party alliances (=coalitions). Such alliances can tip the bias in their favor. The seat-bias formula can be extended to settings with such alliances. [3] :Sub.7.11

For shifted-quota methods

For each shifted-quota method (largest-remainders method) with quota , when entitlement vectors are drawn uniformly at random from the standard simplex,

In particular, Hamilton's method is the only unbiased one in this family.

Simulations

In addition to the theoretic analysis, one can check the actual bias in real problems. Using the USA census data, it was found that the ratio of favoring the larger state over the smaller state for Webster's method is nearest to 50% among all common divisor methods. Many other tests indicate that Webster's method is the least biased. [1]

Related Research Articles

<span class="mw-page-title-main">Discrete Fourier transform</span> Type of Fourier transform in discrete mathematics

In mathematics, the discrete Fourier transform (DFT) converts a finite sequence of equally-spaced samples of a function into a same-length sequence of equally-spaced samples of the discrete-time Fourier transform (DTFT), which is a complex-valued function of frequency. The interval at which the DTFT is sampled is the reciprocal of the duration of the input sequence. An inverse DFT (IDFT) is a Fourier series, using the DTFT samples as coefficients of complex sinusoids at the corresponding DTFT frequencies. It has the same sample-values as the original input sequence. The DFT is therefore said to be a frequency domain representation of the original input sequence. If the original sequence spans all the non-zero values of a function, its DTFT is continuous, and the DFT provides discrete samples of one cycle. If the original sequence is one cycle of a periodic function, the DFT provides all the non-zero values of one DTFT cycle.

<span class="mw-page-title-main">Gram–Schmidt process</span> Orthonormalization of a set of vectors

In mathematics, particularly linear algebra and numerical analysis, the Gram–Schmidt process is a method for orthonormalizing a set of vectors in an inner product space, most commonly the Euclidean space Rn equipped with the standard inner product. The Gram–Schmidt process takes a finite, linearly independent set of vectors S = {v1, ..., vk} for kn and generates an orthogonal set S′ = {u1, ..., uk} that spans the same k-dimensional subspace of Rn as S.

<span class="mw-page-title-main">Linear independence</span> Vectors whose linear combinations are nonzero

In the theory of vector spaces, a set of vectors is said to be linearly independent if there exists no nontrivial linear combination of the vectors that equals the zero vector. If such a linear combination exists, then the vectors are said to be linearly dependent. These concepts are central to the definition of dimension.

<span class="mw-page-title-main">Matrix multiplication</span> Mathematical operation in linear algebra

In mathematics, particularly in linear algebra, matrix multiplication is a binary operation that produces a matrix from two matrices. For matrix multiplication, the number of columns in the first matrix must be equal to the number of rows in the second matrix. The resulting matrix, known as the matrix product, has the number of rows of the first and the number of columns of the second matrix. The product of matrices A and B is denoted as AB.

In mathematics, the dot product or scalar product is an algebraic operation that takes two equal-length sequences of numbers, and returns a single number. In Euclidean geometry, the dot product of the Cartesian coordinates of two vectors is widely used. It is often called the inner product of Euclidean space, even though it is not the only inner product that can be defined on Euclidean space.

<span class="mw-page-title-main">Perceptron</span> Algorithm for supervised learning of binary classifiers

In machine learning, the perceptron is an algorithm for supervised learning of binary classifiers. A binary classifier is a function which can decide whether or not an input, represented by a vector of numbers, belongs to some specific class. It is a type of linear classifier, i.e. a classification algorithm that makes its predictions based on a linear predictor function combining a set of weights with the feature vector.

In linear algebra, an n-by-n square matrix A is called invertible, if there exists an n-by-n square matrix B such that

The D'Hondt method, also called the Jefferson method or the greatest divisors method, is a method for allocating seats in parliaments among federal states, or in party-list proportional representation systems. It belongs to the class of highest-averages methods.

The Webster method, also called the Sainte-Laguë method or the major fractions method, is an apportionment method for allocating seats in a parliament among federal states, or among parties in a party-list proportional representation system.

A highest-averages method, also called a divisor method, is a class of methods for allocating seats in a parliament among agents such as political parties or federal states. A divisor method is an iterative method: at each iteration, the number of votes of each party is divided by its divisor, which is a function of the number of seats currently allocated to that party. The next seat is allocated to the party whose resulting ratio is largest.

<span class="mw-page-title-main">Bloch's theorem</span> Fundamental theorem in condensed matter physics

In condensed matter physics, Bloch's theorem states that solutions to the Schrödinger equation in a periodic potential take the form of a plane wave modulated by a periodic function. The theorem is named after the physicist Felix Bloch, who discovered the theorem in 1929. Mathematically, they are written

In mathematics, the Kronecker product, sometimes denoted by ⊗, is an operation on two matrices of arbitrary size resulting in a block matrix. It is a specialization of the tensor product from vectors to matrices and gives the matrix of the tensor product linear map with respect to a standard choice of basis. The Kronecker product is to be distinguished from the usual matrix multiplication, which is an entirely different operation. The Kronecker product is also sometimes called matrix direct product.

In algebraic geometry and the theory of complex manifolds, a logarithmic differential form is a differential form with poles of a certain kind. The concept was introduced by Pierre Deligne. In short, logarithmic differentials have the mildest possible singularities needed in order to give information about an open submanifold.

In numerical linear algebra, the method of successive over-relaxation (SOR) is a variant of the Gauss–Seidel method for solving a linear system of equations, resulting in faster convergence. A similar method can be used for any slowly converging iterative process.

Mathematics of apportionment describes mathematical principles and algorithms for fair allocation of identical items among parties with different entitlements. Such principles are used to apportion seats in parliaments among federal states or political parties. See apportionment (politics) for the more concrete principles and issues related to apportionment, and apportionment by country for practical methods used around the world.

House monotonicity is a property of apportionment methods and multiwinner voting systems. These are methods for allocating seats in a parliament among federal states. The property says that, if the number of seats in the "house" increases, and the method is re-activated, then no state should have less seats than it previously had. A method that fails to satisfy house-monotonicity is said to have the Alabama paradox.

State-population monotonicity is a property of apportionment methods, which are methods of allocating seats in a parliament among federal states. The property says that, if the population of a state increases faster than that of other states, then it should not lose a seat. An apportionment method that fails to satisfy this property is said to have a population paradox.

Coherence, also called uniformity or consistency, is a criterion for evaluating rules for fair division. Coherence requires that the outcome of a fairness rule is fair not only for the overall problem, but also for each sub-problem. Every part of a fair division should be fair.

Vote-ratio monotonicity (VRM) is a property of apportionment methods, which are methods of allocating seats in a parliament among political parties. The property says that, if the ratio between the number of votes won by party A to the number of votes won by party B increases, then it should NOT happen that party A loses a seat while party B gains a seat.

Balance or balancedness is a property of apportionment methods, which are methods of allocating identical items between among agens, such as dividing seats in a parliament among political parties or federal states. The property says that, if two agents have exactly the same entitlements, then the number of items they receive should differ by at most one. So if two parties win the same number of votes, or two states have the same populations, then the number of seats they receive should differ by at most one.

References

  1. 1 2 3 4 5 6 Balinski, Michel L.; Young, H. Peyton (1982). Fair Representation: Meeting the Ideal of One Man, One Vote . New Haven: Yale University Press. ISBN   0-300-02724-9.
  2. 1 2 Pukelsheim, Friedrich (2017), Pukelsheim, Friedrich (ed.), "Preferring Stronger Parties to Weaker Parties: Majorization", Proportional Representation: Apportionment Methods and Their Applications, Cham: Springer International Publishing, pp. 149–157, doi:10.1007/978-3-319-64707-4_8, ISBN   978-3-319-64707-4 , retrieved 2021-09-01
  3. 1 2 Pukelsheim, Friedrich (2017), Pukelsheim, Friedrich (ed.), "Favoring Some at the Expense of Others: Seat Biases", Proportional Representation: Apportionment Methods and Their Applications, Cham: Springer International Publishing, pp. 127–147, doi:10.1007/978-3-319-64707-4_7, ISBN   978-3-319-64707-4 , retrieved 2021-09-01