Apportionment with parity constraints
From MaRDI portal
Publication:6120934
DOI10.1007/s10107-022-01918-0arXiv2108.04137OpenAlexW3190704365MaRDI QIDQ6120934
Claire Mathieu, Víctor Verdugo
Publication date: 21 February 2024
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2108.04137
Cites Work
- Unnamed Item
- Unnamed Item
- Alternate scaling algorithm for biproportional divisor methods
- Divisor methods for proportional representation systems: an optimization approach to vector and matrix apportionment problems
- Algorithms for proportional matrices in reals and integers
- On the complexity of nonnegative-matrix scaling
- On complexity of matrix scaling
- Better and simpler error analysis of the Sinkhorn-Knopp algorithm for matrix scaling
- On the complexity of general matrix scaling and entropy minimization via the RAS algorithm
- Vector and matrix apportionment problems and separable convex integer optimization
- ON ALLOCATING SEATS TO PARTIES AND DISTRICTS: APPORTIONMENTS
- Network flow methods for electoral systems
- Parametric maximum flow methods for minimax approximation of target quotas in biproportional apportionment
- An Axiomatic Approach to Proportionality Between Matrices
- Divisor-Based Biproportional Apportionment in Electoral Systems: A Real-Life Benchmark Study
- Fair Majority Voting (or How to Eliminate Gerrymandering)
- The Webster method of apportionment
- Controlled Rounding
- A Relationship Between Arbitrary Positive Matrices and Doubly Stochastic Matrices
- Proportional Representation
This page was built for publication: Apportionment with parity constraints
