Stochastic Apportionment
From MaRDI portal
Abstract: The problem of how to allocate to states the seats in the US House of Representatives is the most studied instance of what is termed the `apportionment problem'. We propose a new method of apportionment which is stochastic, which meets the quota condition, and which is fair in the sense of expectations. Two sources of systematic unfairness are identified, firstly the lower bound condition (every state shall receive at least one seat), and secondly the lower quota condition (every state shall receive at least the integer part of its quota).
Recommendations
- scientific article; zbMATH DE number 3920153
- New apportionment methods and their quota property
- A family of Hamilton type methods for congressional apportionments
- Appointment Methods for the House of Representatives and the Court Challenges
- On rounding off quotas to the nearest integers in the problem of apportionment
Cited in
(7)- Estimation of parameters for a scheme of random allocation
- Aggregating randomized and vector valued allocations
- Randomized allocation processes
- scientific article; zbMATH DE number 5726465 (Why is no real title available?)
- On party-proportional representation under district distortions
- Random apportionment: a stochastic solution to the Balinski-Young impossibility
- Candidate monotonicity and proportionality for lotteries and non-resolute rules
This page was built for publication: Stochastic Apportionment
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5295518)
