Network flow methods for electoral systems
From MaRDI portal
Recommendations
- Network models and biproportional rounding for fair seat allocations in the UK elections
- Error minimization methods in biproportional apportionment
- Certificates of optimality: the third way to biproportional apportionment
- Parametric maximum flow methods for minimax approximation of target quotas in biproportional apportionment
- The give-up problem for blocked regional lists with multi-winners
Cites work
- A polynomial algorithm for minimum quadratic cost flow problems
- Aggregate Data, Ecological Regression, and Voting Transitions
- Algorithms for proportional matrices in reals and integers
- An Axiomatic Approach to Proportionality Between Matrices
- An Out-of-Kilter Method for Minimal-Cost Flow Problems
- Certificates of optimality: the third way to biproportional apportionment
- 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
- Estimating Nonnegative Matrices from Marginal Data
- scientific article; zbMATH DE number 4089320 (Why is no real title available?)
- scientific article; zbMATH DE number 1045885 (Why is no real title available?)
- scientific article; zbMATH DE number 3311499 (Why is no real title available?)
- Network flows. Theory, algorithms, and applications.
- On a Least Squares Adjustment of a Sampled Frequency Table When the Expected Marginal Totals are Known
- On the complexity of general matrix scaling and entropy minimization via the RAS algorithm
- On the RAS-algorithm
- Optimal political districting
- Parametric maximum flow methods for minimax approximation of target quotas in biproportional apportionment
- Scalings of matrices which have prespecified row sums and column sums via optimization
- Solving integer minimum cost flows with separable convex cost objective polynomially
- The give-up problem for blocked regional lists with multi-winners
- Vector and matrix apportionment problems and separable convex integer optimization
Cited in
(16)- A model for the assignment of candidates to constituencies in a mixed election system
- An exact algorithm for designing optimal districts in the collection of waste electric and electronic equipment through an improved reformulation
- Multi-attribute proportional representation
- Error minimization methods in biproportional apportionment
- A location-allocation-improvement heuristic for districting with multiple-activity balancing constraints and \(p\)-median-based dispersion minimization
- Improved lattice-based mix-nets for electronic voting
- Integer solutions to bankruptcy problems: the IPROP solution
- Certificates of optimality for minimum norm biproportional apportionments
- Network models and biproportional rounding for fair seat allocations in the UK elections
- Parametric maximum flow methods for minimax approximation of target quotas in biproportional apportionment
- Certificates of optimality: the third way to biproportional apportionment
- The give-up problem for blocked regional lists with multi-winners
- Apportionment with parity constraints
- Proportionality in multiple dimensions to design electoral systems
- Bidimensional allocation of seats via zero-one matrices with given line sums
- Biproportional scaling of matrices and the iterative proportional fitting procedure
This page was built for publication: Network flow methods for electoral systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2892147)
