IDEAS home Printed from https://ideas.repec.org/h/spr/stcchp/978-3-540-35605-9_8.html
   My bibliography  Save this book chapter

Algorithms for Biproportional Apportionment

In: Mathematics and Democracy

Author

Listed:
  • Sebastian Maier

    (Universität Augsburg)

Abstract

For the biproportional apportionment problem two algorithms are discussed, that are implemented in the Augsburg BAZI program, the alternating scaling algorithm and the tie-and-transfer algorithm of Balinski and Demange (1989b). The goal is to determine an integer-valued apportionment matrix that is “proportional to” a matrix of input weights (e.g. vote counts) and that at the same time achieves prespecified row and column marginals. The alternating scaling algorithm finds the solution of most of the practical problems very efficiently. However, it is possible to create examples for which the procedure fails. The tie-and-transfer algorithm converges always, though convergence may be slow. In order to make use of the benefits of both algorithms, a hybrid version is proposed.

Suggested Citation

  • Sebastian Maier, 2006. "Algorithms for Biproportional Apportionment," Studies in Choice and Welfare, in: Bruno Simeone & Friedrich Pukelsheim (ed.), Mathematics and Democracy, pages 105-116, Springer.
  • Handle: RePEc:spr:stcchp:978-3-540-35605-9_8
    DOI: 10.1007/3-540-35605-3_8
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    Citations

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


    Cited by:

    1. Sebastian Maier & Petur Zachariassen & Martin Zachariasen, 2010. "Divisor-Based Biproportional Apportionment in Electoral Systems: A Real-Life Benchmark Study," Management Science, INFORMS, vol. 56(2), pages 373-387, February.
    2. V. I. Blanutsa & K. A. Cherepanov, 2019. "Regional Information Flows: Existing and New Approaches to Geographical Study," Regional Research of Russia, Springer, vol. 9(1), pages 97-106, January.
    3. Gaffke, Norbert & Pukelsheim, Friedrich, 2008. "Divisor methods for proportional representation systems: An optimization approach to vector and matrix apportionment problems," Mathematical Social Sciences, Elsevier, vol. 56(2), pages 166-184, September.

    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:spr:stcchp:978-3-540-35605-9_8. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.