Divisor methods for proportional representation systems: an optimization approach to vector and matrix apportionment problems

DOI10.1016/j.mathsocsci.2008.01.004zbMath1143.49030OpenAlexW2164583093MaRDI QIDQ943580

Friedrich Pukelsheim, Norbert Gaffke

Publication date: 10 September 2008

Published in: Mathematical Social Sciences (Search for Journal in Brave)

Full work available at URL: https://opus.bibliothek.uni-augsburg.de/opus4/frontdoor/index/index/docId/515

zbMATH Keywords

biproportional divisor methodselementary vectorsiterative proportional Fitting proceduretransportation-type algorithmZurich's new apportionment procedure

Mathematics Subject Classification ID

Applications of optimal control and differential games (49N90) Duality theory (optimization) (49N15)

Related Items (10)

Alternate scaling algorithm for biproportional divisor methods ⋮ Network flow methods for electoral systems ⋮ Parametric maximum flow methods for minimax approximation of target quotas in biproportional apportionment ⋮ Network models and biproportional rounding for fair seat allocations in the UK elections ⋮ Error minimization methods in biproportional apportionment ⋮ Apportionment with parity constraints ⋮ Certificates of optimality: the third way to biproportional apportionment ⋮ Vector and matrix apportionment problems and separable convex integer optimization ⋮ Asymptotic bias of some election methods ⋮ Certificates of optimality for minimum norm biproportional apportionments

Uses Software

• Bazi

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Rounding with multiplier methods: An efficient algorithm and applications in statistics
• Parametric methods of apportionment, rounding and production
• Algorithms for proportional matrices in reals and integers
• Mandate assignment in proportional representation: equal success value of votes
• Rounding probabilities: Maximum probability and minimum complexity multipliers
• Mathématiques et politique
• On the complexity of general matrix scaling and entropy minimization via the RAS algorithm
• 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.
• Scaling of matrices to achieve specified row and column sums
• An Axiomatic Approach to Proportionality Between Matrices
• A conforming decomposition theorem, a piecewise linear theorem of the alternative, and scalings of matrices satisfying lower and upper bounds
• One-sided simultaneous inequalities and sandwich theorems for diagonal similarity and diagonal equivalence of nonnegative matrices
• Estimating Nonnegative Matrices from Marginal Data
• On a Least Squares Adjustment of a Sampled Frequency Table When the Expected Marginal Totals are Known
• An Iterative Method of Adjusting Sample Frequency Tables When Expected Marginal Totals are Known

This page was built for publication: Divisor methods for proportional representation systems: an optimization approach to vector and matrix apportionment problems