Apportionment with parity constraints
From MaRDI portal
Publication:6120934
Abstract: In the classic apportionment problem the goal is to decide how many seats of a parliament should be allocated to each party as a result of an election. The divisor methods provide a way of solving this problem by defining a notion of proportionality guided by some rounding rule. Motivated by recent challenges in the context of electoral apportionment, we consider the question of how to allocate the seats of a parliament under parity constraints between candidate types (e.g. equal number of men and women elected) while at the same time satisfying party proportionality. We consider two different approaches for this problem. The first mechanism, that follows a greedy approach, corresponds to a recent mechanism used in the Chilean Constitutional Convention 2021 election. We analyze this mechanism from a theoretical point of view. The second mechanism follows the idea of biproportionality introduced by Balinski and Demange [Math. Program. 1989, Math. Oper. Res. 1989]. In contrast with the classic biproportional method by Balinski and Demange, this mechanism is ruled by two levels of proportionality: Proportionality is satisfied at the level of parties by means of a divisor method, and then biproportionality is used to decide the number of candidates allocated to each type and party. We provide a theoretical analysis of this mechanism, making progress on the theoretical understanding of methods with two levels of proportionality. A typical benchmark used in the context of two-dimensional apportionment is the fair share (a.k.a matrix scaling), which corresponds to an ideal fractional biproportional solution. We provide lower bounds on the distance between these two types of solutions, and we explore their consequences in the context of two-dimensional apportionment.
Recommendations
Cites work
- A Relationship Between Arbitrary Positive Matrices and Doubly Stochastic Matrices
- Algorithms for proportional matrices in reals and integers
- Alternate scaling algorithm for biproportional divisor methods
- An Axiomatic Approach to Proportionality Between Matrices
- Better and simpler error analysis of the Sinkhorn-Knopp algorithm for matrix scaling
- Controlled Rounding
- Divisor methods for proportional representation systems: an optimization approach to vector and matrix apportionment problems
- Divisor-based biproportional apportionment in electoral systems: a real-life benchmark study
- Fair Majority Voting (or How to Eliminate Gerrymandering)
- scientific article; zbMATH DE number 7657254 (Why is no real title available?)
- Matrix scaling by network flow
- Network flow methods for electoral systems
- On allocating seats to parties and districts: apportionments
- On complexity of matrix scaling
- On the complexity of general matrix scaling and entropy minimization via the RAS algorithm
- On the complexity of nonnegative-matrix scaling
- Parametric maximum flow methods for minimax approximation of target quotas in biproportional apportionment
- Proportional Representation
- The Webster method of apportionment
- Vector and matrix apportionment problems and separable convex integer optimization
Cited in
(2)
This page was built for publication: Apportionment with parity constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6120934)
