Network models and biproportional rounding for fair seat allocations in the UK elections

DOI10.1007/S10479-016-2323-0MaRDI QIDQ2399304zbMATH OpenOpenAlexWikidataFDO

Authors Kerem Akartunalı, Philip A. Knight

Publication date 22 August 2017

Published in Annals of Operations Research (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/s10479-016-2323-0

zbMATH Keywords

biproportional matricesfair seat allocationinteger programmingnetworks and graphs

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Deterministic scheduling theory in operations research (90B35) Integer programming (90C10)

Recommendations

• Network flow methods for electoral systems
• Error minimization methods in biproportional apportionment
• On allocating seats to parties and districts: apportionments
• Matrices and politics
• Certificates of optimality: the third way to biproportional apportionment

Cites work

• Algorithms for proportional matrices in reals and integers
• Apportionments with minimum Gini index of disproportionality: a quadratic knapsack approach
• Assignment Problems
• Biproportional scaling of matrices and the iterative proportional fitting procedure
• Convex Sets of Non-Negative Matrices
• 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
• Error minimization methods in biproportional apportionment
• Fair Majority Voting (or How to Eliminate Gerrymandering)
• scientific article; zbMATH DE number 1416629 (Why is no real title available?)
• scientific article; zbMATH DE number 3311499 (Why is no real title available?)
• Matrices and politics
• Matrix scaling by network flow
• Max algebra and the linear assignment problem
• Network flow methods for electoral systems
• Network flows. Theory, algorithms, and applications.
• 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
• Some remarks on the concept of proportionality
• The Sinkhorn–Knopp Algorithm: Convergence and Applications
• Vector and matrix apportionment problems and separable convex integer optimization

Cited in

(2)

• Network models and biproportional rounding for fair seat allocations in the UK elections
• Network flow methods for electoral systems

This page was built for publication: Network models and biproportional rounding for fair seat allocations in the UK elections

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2399304)