IDEAS home Printed from https://ideas.repec.org/a/bla/stanee/v32y1978i4p163-179.html
   My bibliography  Save this article

The proportional representation problem in the Second Chamber: an approach via minimal distances

Author

Listed:
  • H. J. J. te Riele

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.

Suggested Citation

  • H. J. J. te Riele, 1978. "The proportional representation problem in the Second Chamber: an approach via minimal distances," Statistica Neerlandica, Netherlands Society for Statistics and Operations Research, vol. 32(4), pages 163-179, December.
    • Handle: RePEc:bla:stanee:v:32:y:1978:i:4:p:163-179
    DOI: 10.1111/j.1467-9574.1978.tb01397.x
    as

    Download full text from publisher

    File URL: https://doi.org/10.1111/j.1467-9574.1978.tb01397.x
    Download Restriction: no
    File URL: https://libkey.io/10.1111/j.1467-9574.1978.tb01397.x?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Gianfranco Gambarelli, 1999. "Maximax Apportionments," Group Decision and Negotiation, Springer, vol. 8(6), pages 441-461, November.
    2. Katarzyna Cegiełka & Janusz Łyko & Radosław Rudek, 2019. "Beyond the Cambridge Compromise algorithm towards degressively proportional allocations," Operational Research, Springer, vol. 19(2), pages 317-332, June.
    3. N. Gaffke & F. Pukelsheim, 2008. "Vector and matrix apportionment problems and separable convex integer optimization," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 67(1), pages 133-159, February.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:bla:stanee:v:32:y:1978:i:4:p:163-179. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Wiley Content Delivery (email available below). General contact details of provider: http://www.blackwellpublishing.com/journal.asp?ref=0039-0402 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.