The proportional representation problem in the Second Chamber: an approach via minimal distances
H. J. J. te Riele
Statistica Neerlandica, 1978, vol. 32, issue 4, 163-179
Abstract:
Abstract The purpose of this paper is to discuss the proportional representation problem in the Second Chamber of Dutch Parliament. Firstly, the present procedure for solving this problem is described, together with a possible alternative procedure, recently proposed by F. J. Lisman. Next, the problem is formulated as that of minimizing some distance coefficient between the distribution of the votes of the electorate and that of the seats in the Second Chamber. For distances which satisfy a specific convexity condition a simple and straight forward algorithm is given for computing a distance minimizing seat distribution. The procedure of Lisman is shown to have three attractive properties by which it is distinguished from the other usual procedures for solving the proportional representation problem. Finally, the principle of the weighted vote is introduced as a means of breaking the deadlock which always comes into being, because of the inevitable discrepancy between the vote distribution and the actual seat distribution.
Date: 1978
References: Add references at CitEc
Citations: View citations in EconPapers (3)
Downloads: (external link)
https://doi.org/10.1111/j.1467-9574.1978.tb01397.x
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:bla:stanee:v:32:y:1978:i:4:p:163-179
Ordering information: This journal article can be ordered from
http://www.blackwell ... bs.asp?ref=0039-0402
Access Statistics for this article
Statistica Neerlandica is currently edited by Miroslav Ristic, Marijtje van Duijn and Nan van Geloven
More articles in Statistica Neerlandica from Netherlands Society for Statistics and Operations Research
Bibliographic data for series maintained by Wiley Content Delivery ().