The Webster method of apportionment

DOI10.1073/PNAS.77.1.1MaRDI QIDQ3870710zbMATH OpenOpenAlexWikidataFDO

Authors H. Peyton Young, Michel Balinski

Publication date 1980

Published in Proceedings of the National Academy of Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1073/pnas.77.1.1

zbMATH Keywords

allocationapportionmentdemocratic representationdivisor methodsfair divisiongovernmental systemmajor fractions methodmethod of odd numberspopulation monotone methodrepresentationU.S. constitutionunbiased methodWebster method

Mathematics Subject Classification ID

Game theory (91A99) Social choice (91B14) Mathematical sociology (including anthropology) (91D99)

Cited in

(8)

• Webster sequences, apportionment problems, and just-in-time sequencing
• Bounds on malapportionment
• The whole and its parts: on the coherence theorem of Balinski and Young
• Hybrid Hamilton-Webster and the Greek apportionment
• Apportionment with parity constraints
• Adaptive signal control for conflicting vehicle and pedestrian flows
• Apportionment when seats are allocated in lots. The D'Hondt method case and political implications
• One man, one vote, one price

This page was built for publication: The Webster method of apportionment

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