Network flow methods for electoral systems
From MaRDI portal
Publication:2892147
DOI10.1002/net.20480zbMath1241.91043OpenAlexW1973032487MaRDI QIDQ2892147
Federica Ricca, Paolo Serafini, Friedrich Pukelsheim, Andrea Scozzari, Bruno Simeone
Publication date: 18 June 2012
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.20480
network flowselectoral systemsmatrix scalingpolitical districtingbiproportional seat apportionmentclosed listsgive-up
Related Items (11)
Integer solutions to bankruptcy problems: the IPROP solution ⋮ Network models and biproportional rounding for fair seat allocations in the UK elections ⋮ Error minimization methods in biproportional apportionment ⋮ Apportionment with parity constraints ⋮ An exact algorithm for designing optimal districts in the collection of waste electric and electronic equipment through an improved reformulation ⋮ Multi-attribute proportional representation ⋮ The give-up problem for blocked regional lists with multi-winners ⋮ A location-allocation-improvement heuristic for districting with multiple-activity balancing constraints and \(p\)-median-based dispersion minimization ⋮ Bidimensional allocation of seats via zero-one matrices with given line sums ⋮ Biproportional scaling of matrices and the iterative proportional fitting procedure ⋮ Certificates of optimality for minimum norm biproportional apportionments
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Certificates of optimality: the third way to biproportional apportionment
- The give-up problem for blocked regional lists with multi-winners
- A polynomial algorithm for minimum quadratic cost flow problems
- Divisor methods for proportional representation systems: an optimization approach to vector and matrix apportionment problems
- Scalings of matrices which have prespecified row sums and column sums via optimization
- On the RAS-algorithm
- Optimal political districting
- Algorithms for proportional matrices in reals and integers
- On the complexity of general matrix scaling and entropy minimization via the RAS algorithm
- Vector and matrix apportionment problems and separable convex integer optimization
- 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
- Solving integer minimum cost flows with separable convex cost objective polynomially
- Aggregate Data, Ecological Regression, and Voting Transitions
- An Out-of-Kilter Method for Minimal-Cost Flow Problems
- Controlled Rounding
- Estimating Nonnegative Matrices from Marginal Data
- On a Least Squares Adjustment of a Sampled Frequency Table When the Expected Marginal Totals are Known
This page was built for publication: Network flow methods for electoral systems
