eprintid: 14051
rev_number: 6
eprint_status: archive
userid: 5
dir: disk0/00/01/40/51
datestamp: 2016-12-01 14:37:27
lastmod: 2021-08-27 17:28:09
status_changed: 2016-12-01 14:37:27
type: article
metadata_visibility: show
item_issues_count: 2
creators_name: Balinski, M.L.
creators_name: Young, H.P.
creators_id: AL0014
creators_id: AL1397
title: Quotatone Apportionment Methods
ispublished: pub
divisions: prog_tes
abstract: The problem of apportionment is that of allocating an integer number of seats “proportionally” among a set of states or regions as a fraction of their populations. An apportionment method satisfies quota if it accords to each state the exactly proportional (rational) number of seats due it rounded up or rounded down. A method is house monotone if no state’s allocation goes down when the total number of seats to be distributed goes up.

This paper gives a simple characterization of all house monotone methods satisfying quota. Further, a manner of exposition is formulated which unites several key house monotone apportionment methods, thus showing clearly their connections.
date: 1979-02
date_type: published
publisher: INFORMS
id_number: 10.1287/moor.4.1.31
creators_browse_id: 1703
creators_browse_id: 2539
full_text_status: none
publication: Mathematics of Operations Research
volume: 4
number: 1
pagerange: 31-38
refereed: TRUE
issn: 0364-765X
coversheets_dirty: FALSE
fp7_type: info:eu-repo/semantics/article
citation:   Balinski, M.L. <https://pure.iiasa.ac.at/view/iiasa/1703.html> & Young, H.P. <https://pure.iiasa.ac.at/view/iiasa/2539.html>  (1979).  Quotatone Apportionment Methods.   Mathematics of Operations Research 4 (1) 31-38. 10.1287/moor.4.1.31 <https://doi.org/10.1287/moor.4.1.31>.