Parametric maximum flow methods for minimax approximation of target quotas in biproportional apportionment
From MaRDI portal
Publication:2892156
DOI10.1002/net.20434zbMath1241.91044MaRDI QIDQ2892156
Publication date: 18 June 2012
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.20434
electoral systems; lexicographic optimization; parametric maximum flow; biproportional apportionment
Related Items
Alternate scaling algorithm for biproportional divisor methods, Allocation of the EU parliament seats via integer linear programming and revised quotas, Certificates of optimality: the third way to biproportional apportionment, Fair apportionment in the view of the Venice Commission's recommendation, Multi-attribute proportional representation, Error minimization methods in biproportional apportionment, Certificates of optimality for minimum norm biproportional apportionments, Network models and biproportional rounding for fair seat allocations in the UK elections, Network flow methods for electoral systems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Certificates of optimality: the third way to biproportional apportionment
- A polynomial algorithm for minimum quadratic cost flow problems
- A theorem on flows in networks
- Complexity and algorithms for convex network optimization and other nonlinear problems
- Divisor methods for proportional representation systems: an optimization approach to vector and matrix apportionment problems
- Algorithms for proportional matrices in reals and integers
- A bi-proportional method applied to the spanish congress
- On the complexity of general matrix scaling and entropy minimization via the RAS algorithm
- Vector and matrix apportionment problems and separable convex integer optimization
- An Axiomatic Approach to Proportionality Between Matrices
- Solving integer minimum cost flows with separable convex cost objective polynomially
- On the structure of all minimum cuts in a network and applications
- Controlled Rounding
- Evaluation and Optimization of Electoral Systems
- Polynomial Methods for Separable Convex Optimization in Unimodular Linear Spaces with Applications
