Error minimization methods in biproportional apportionment
From MaRDI portal
Publication:1939088
DOI10.1007/s11750-012-0252-xzbMath1262.90204OpenAlexW2041583024MaRDI QIDQ1939088
Paolo Serafini, Andrea Scozzari, Federica Ricca, Bruno Simeone
Publication date: 26 February 2013
Published in: Top (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11750-012-0252-x
Related Items (4)
Network models and biproportional rounding for fair seat allocations in the UK elections ⋮ Heuristic and exact solutions to the inverse power index problem for small voting bodies ⋮ Bidimensional allocation of seats via zero-one matrices with given line sums ⋮ Certificates of optimality for minimum norm biproportional apportionments
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
- 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
- Vector and matrix apportionment problems and separable convex integer optimization
- Mathematics and democracy. Recent advances in voting systems and collective choice. Including papers from the International Workshop on Mathematics and Democracy: Voting Systems and Collective Choice, held in Erice, September 18--23, 2005.
- 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
- Solving integer minimum cost flows with separable convex cost objective polynomially
- Controlled Rounding
- Estimating Nonnegative Matrices from Marginal Data
This page was built for publication: Error minimization methods in biproportional apportionment
