Divisor methods for proportional representation systems: An optimization approach to vector and matrix apportionment problems

Norbert Gaffke and Friedrich Pukelsheim

Mathematical Social Sciences, 2008, vol. 56, issue 2, 166-184

Abstract: When the seats in a parliamentary body are to be allocated proportionally to some given weights, such as vote counts or population data, divisor methods form a prime class to carry out the apportionment. We present a new characterization of divisor methods, via primal and dual optimization problems. The primal goal function is a cumulative product of the discontinuity points of the rounding rule. The variables of the dual problem are the multipliers used to scale the weights before they get rounded. Our approach embraces pervious and impervious divisor methods, and vector and matrix problems.

Keywords: Biproportional; divisor; methods; Elementary; vectors; Iterative; proportional; fitting; procedure; Transportation-type; algorithm; Zurich's; new; apportionment; procedure (search for similar items in EconPapers)
Date: 2008
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (5)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0165-4896(08)00028-0
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:matsoc:v:56:y:2008:i:2:p:166-184

Access Statistics for this article

Mathematical Social Sciences is currently edited by J.-F. Laslier

More articles in Mathematical Social Sciences from Elsevier
Bibliographic data for series maintained by Catherine Liu ().