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 several mathematical measures of bias, which can disagree slightly.

Contents

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.

Stationary divisor methods

For each stationary divisor method, i.e. one where seats correspond to a divisor , and 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.

Real-world data

In addition to theoretical analysis, one can check the actual bias of a method in real-world distributions. Using United States census data, Balinski and Young found Webster's method to be the least median-biased estimator for comparing pairs of states, followed closely by the Huntington-Hill technique. [1] However, Ernst (1994) found that when using other definitions of bias, the Huntington-Hill method can also be described as least biased. [4]

Related Research Articles

<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.

<span class="mw-page-title-main">Cross product</span> Mathematical operation on vectors in 3D space

In mathematics, the cross product or vector product is a binary operation on two vectors in a three-dimensional oriented Euclidean vector space, and is denoted by the symbol . Given two linearly independent vectors a and b, the cross product, a × b, is a vector that is perpendicular to both a and b, and thus normal to the plane containing them. It has many applications in mathematics, physics, engineering, and computer programming. It should not be confused with the dot product.

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.

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.

The D'Hondt method, also called the Jefferson method or the greatest divisors method, is an apportionment method for allocating seats in parliaments among federal states, or in proportional representation among political parties. It belongs to the class of highest-averages methods. The D'Hondt method reduces compared to ideal proportional representation somewhat the political fragmentation for smaller electoral district sizes, where it favors larger political parties over small parties.

The Webster method, also called the Sainte-Laguë method, is a highest averages apportionment method for allocating seats in a parliament among federal states, or among parties in a party-list proportional representation system. The Sainte-Laguë method shows a more equal seats-to-votes ratio for different sized parties among apportionment methods.

In mathematics, economics, and social choice theory, the highest averages method, also called the divisor method, is an apportionment algorithm most well-known for its common use in proportional representation. Divisor algorithms seek to fairly divide a legislature between several groups, such as political parties or states. More generally, divisor methods are used for rounding a set of real numbers to a whole number of objects.

In algebra, a group ring is a free module and at the same time a ring, constructed in a natural way from any given ring and any given group. As a free module, its ring of scalars is the given ring, and its basis is the set of elements of the given group. As a ring, its addition law is that of the free module and its multiplication extends "by linearity" the given group law on the basis. Less formally, a group ring is a generalization of a given group, by attaching to each element of the group a "weighting factor" from a given ring.

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 classical mechanics, the Laplace–Runge–Lenz (LRL) vector is a vector used chiefly to describe the shape and orientation of the orbit of one astronomical body around another, such as a binary star or a planet revolving around a star. For two bodies interacting by Newtonian gravity, the LRL vector is a constant of motion, meaning that it is the same no matter where it is calculated on the orbit; equivalently, the LRL vector is said to be conserved. More generally, the LRL vector is conserved in all problems in which two bodies interact by a central force that varies as the inverse square of the distance between them; such problems are called Kepler problems.

In mechanics, virtual work arises in the application of the principle of least action to the study of forces and movement of a mechanical system. The work of a force acting on a particle as it moves along a displacement is different for different displacements. Among all the possible displacements that a particle may follow, called virtual displacements, one will minimize the action. This displacement is therefore the displacement followed by the particle according to the principle of least action.

The work of a force on a particle along a virtual displacement is known as the virtual work.

Curvilinear coordinates can be formulated in tensor calculus, with important applications in physics and engineering, particularly for describing transportation of physical quantities and deformation of matter in fluid mechanics and continuum mechanics.

In orbital mechanics, Gauss's method is used for preliminary orbit determination from at least three observations of the orbiting body of interest at three different times. The required information are the times of observations, the position vectors of the observation points, the direction cosine vector of the orbiting body from the observation points and general physical data.

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. 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 fewer 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 or political parties. The property says that if the population of State A increases faster than that of State B, then State A should not lose any seats to State B. Apportionment methods violating this rule are called population paradoxes.

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.

In apportionment theory, rank-index methods are a set of apportionment methods that generalize the divisor method. These have also been called Huntington methods, since they generalize an idea by Edward Vermilye Huntington.

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
  4. Ernst, Lawrence R. (1994). "Apportionment Methods for the House of Representatives and the Court Challenges". Management Science. 40 (10): 1207–1227. ISSN   0025-1909.