Thresholds of the divisor methods

DOI10.1023/B:NUMA.0000005353.82970.CEMaRDI QIDQ1418858zbMATH OpenOpenAlexFDO

Authors D. Massart, Valentín Ramírez

Publication date 14 January 2004

Published in Numerical Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/b:numa.0000005353.82970.ce

zbMATH Keywords

electoral systemsproportional representation

Mathematics Subject Classification ID

Voting theory (91B12)

Recommendations

• scientific article; zbMATH DE number 1440645
• A note on relaxed divisor methods
• On the Q-divisor method and its application
• A deterministic algorithm for computing divisors in an interval
• The Divisibility of Divisor Functions
• Higher moments of the error term in the divisor problem
• On the higher moments of the error term in the divisor problem
• Division algorithm and Kronecker's approximation theorem
• scientific article; zbMATH DE number 1540643
• Estimates in the general divisor problem

Cited in

(6)

• Seat biases in proportional representation systems with thresholds
• The Balinski-Young comparison of divisor methods is transitive
• Finding the threshold of exclusion for all single seat and multi-seat scoring rules: illustrated by results for the Borda and Dowdall rules
• A generalized parametric divisor method for political apportionment
• The senatorial election in spain. Proportional Borda methods for selecting several candidates
• Evaluation of thresholds for power mean-based and other divisor methods of apportionment

This page was built for publication: Thresholds of the divisor methods

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