A Class of New Methods for Congressional Apportionment

DOI10.1137/0137031zbMATH Open0416.90039OpenAlexW2089663932MaRDI QIDQ3206652FDOQ3206652

Authors: Jonathan W. Still 

Publication date: 1979

Published in: SIAM Journal on Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0137031

zbMATH Keywords

sociologypoliticsapportionment methodmodified largest remainder methodquota and house monotonicityquotatone apportionmentsrecursive apportionments

Mathematics Subject Classification ID

Mathematical sociology (including anthropology) (91D99) Operations research and management science (90B99)

Cited In (10)

• Apportionment methods and the Liu-Layland problem
• An application of a few inequalities among sequences in electoral systems
• A note on bottleneck product rate variation problem with square-deviation objective
• A generalized parametric divisor method for political apportionment
• Solution of the Liu-Layland problem via bottleneck just-in-time sequencing
• A simple approach to the product rate variation problem via axiomatics
• Solving the generalized apportionment problem through the optimization of discrepancy functions
• The bounds of votes of divisor electoral methods
• Just-in-time scheduling in modern mass production environment
• Solving the minmax product rate variation problem (PRVP) as a bottleneck assignment problem

This page was built for publication: A Class of New Methods for Congressional Apportionment

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