A simple and fast linear-time algorithm for divisor methods of apportionment

DOI10.1007/s10107-023-01929-5MaRDI QIDQ6120938

Sebastian Wild, Raphael Reitzig

Publication date: 21 February 2024

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

zbMATH Keywords

fair divisionselection algorithmsdivisor methodsrounding percentagesproportional apportionmentD'Hondt method

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Voting theory (91B12) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Cites Work

• Unnamed Item
• Unnamed Item
• Rounding with multiplier methods: An efficient algorithm and applications in statistics
• Time bounds for selection
• Building fences straight and high: an optimal algorithm for finding the maximum length you can cut \(k\) times from given sticks
• Algorithms for proportional matrices in reals and integers
• Proportional Representation
• An Axiomatic Approach to Proportionality Between Matrices
• Waste Makes Haste

This page was built for publication: A simple and fast linear-time algorithm for divisor methods of apportionment