IDEAS home Printed from https://ideas.repec.org/a/eee/matsoc/v80y2016icp25-32.html
   My bibliography  Save this article

Alternate Scaling algorithm for biproportional divisor methods

Author

Listed:
  • Oelbermann, Kai-Friederike

Abstract

In parliamentary elections biproportional divisor methods translate votes into seats so that for each district fixed seat contingents are met and that every party receives as many seats as the overall vote counts reflect. A set of district-divisors and party-divisors ensures that proportionality is respected both within the districts and within the parties. The divisors can be calculated by means of the Alternate Scaling algorithm (AS-algorithm). It is the discrete variant of the iterative proportional fitting procedure (IPF-procedure). The AS-algorithm iteratively generates scaled vote matrices that after rounding alternately fulfill the district-contingents and the party-seats. Thus it defines two sequences: the AS-scaling-sequence and the AS-seat-sequence. The central question in this paper is: under which conditions does the AS-algorithm generate a biproportional apportionment? The conjecture of Balinski and Pukelsheim (2006) is partially proven. We show that if the set of biproportional apportionments does not contain more than three elements then the AS-algorithm is able to determine it. In the rare event that the set of biproportional apportionments cannot be determined by the AS-algorithm, the complementary AS-Tie&Transfer-combination puts things right. Its analysis leads to a constructive proof of necessary and sufficient conditions for the existence of biproportional apportionments. If these conditions are violated the sequences generated by the AS-algorithms may have more than two accumulation points. On the contrary, the IPF-procedure has at most two accumulation points.

Suggested Citation

  • Oelbermann, Kai-Friederike, 2016. "Alternate Scaling algorithm for biproportional divisor methods," Mathematical Social Sciences, Elsevier, vol. 80(C), pages 25-32.
    • Handle: RePEc:eee:matsoc:v:80:y:2016:i:c:p:25-32
    DOI: 10.1016/j.mathsocsci.2016.02.003
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0165489616000147
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.mathsocsci.2016.02.003?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Michel L. Balinski & Gabrielle Demange, 1989. "Algorithm for Proportional Matrices in Reals and Integers," Post-Print halshs-00585327, HAL.
    2. M. L. Balinski & G. Demange, 1989. "An Axiomatic Approach to Proportionality Between Matrices," Mathematics of Operations Research, INFORMS, vol. 14(4), pages 700-719, November.
    3. Marjorie B. Gassner, 1991. "Biproportional Delegations," Journal of Theoretical Politics, , vol. 3(3), pages 321-342, July.
    4. 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.
    5. 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.
    6. 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.
    7. Marjorie Gassner, 1989. "An impossibility theorem for fair bidimensional representation: Towards a biproportional solution," ULB Institutional Repository 2013/232154, ULB -- Universite Libre de Bruxelles.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Demange, Gabrielle, 2012. "On party-proportional representation under district distortions," Mathematical Social Sciences, Elsevier, vol. 63(2), pages 181-191.
    2. Gabrielle Demange, 2013. "On Allocating Seats To Parties And Districts: Apportionments," International Game Theory Review (IGTR), World Scientific Publishing Co. Pte. Ltd., vol. 15(03), pages 1-14.
    3. Paolo Serafini, 2015. "Certificates of optimality for minimum norm biproportional apportionments," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 44(1), pages 1-12, January.
    4. Kerem Akartunalı & Philip A. Knight, 2017. "Network models and biproportional rounding for fair seat allocations in the UK elections," Annals of Operations Research, Springer, vol. 253(1), pages 1-19, June.
    5. Victoriano Ramírez-González & Blanca Delgado-Márquez & Antonio Palomares & Adolfo López-Carmona, 2014. "Evaluation and possible improvements of the Swedish electoral system," Annals of Operations Research, Springer, vol. 215(1), pages 285-307, April.
    6. Friedrich Pukelsheim, 2014. "Biproportional scaling of matrices and the iterative proportional fitting procedure," Annals of Operations Research, Springer, vol. 215(1), pages 269-283, April.
    7. 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.
    8. 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.
    9. Gabrielle Demange, 2021. "On the resolution of cross-liabilities," PSE Working Papers halshs-03151128, HAL.
    10. Michel Balinski, 2007. "Equitable representation and recruitment," Annals of Operations Research, Springer, vol. 149(1), pages 27-36, February.
    11. Marjorie B. Gassner, 1991. "Biproportional Delegations," Journal of Theoretical Politics, , vol. 3(3), pages 321-342, July.
    12. Ricca, Federica & Scozzari, Andrea & Simeone, Bruno, 2011. "The give-up problem for blocked regional lists with multi-winners," Mathematical Social Sciences, Elsevier, vol. 62(1), pages 14-24, July.
    13. Gabrielle Demange, 2020. "Resolution rules in a system of financially linked firms," Working Papers hal-02502413, HAL.
    14. Gabrielle Demange, 2018. "New electoral systems and old referendums," PSE Working Papers hal-01852206, HAL.
    15. Demange, Gabrielle, 2017. "Mutual rankings," Mathematical Social Sciences, Elsevier, vol. 90(C), pages 35-42.
    16. Federica Ricca & Andrea Scozzari & Paolo Serafini & Bruno Simeone, 2012. "Error minimization methods in biproportional apportionment," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 20(3), pages 547-577, October.
    17. Moulin, Hervé, 2016. "Entropy, desegregation, and proportional rationing," Journal of Economic Theory, Elsevier, vol. 162(C), pages 1-20.
    18. Svante Janson, 2014. "Asymptotic bias of some election methods," Annals of Operations Research, Springer, vol. 215(1), pages 89-136, April.
    19. Niemeyer, Horst F. & Niemeyer, Alice C., 2008. "Apportionment methods," Mathematical Social Sciences, Elsevier, vol. 56(2), pages 240-253, September.
    20. Michel L. Balinski & Gabrielle Demange, 1989. "Algorithm for Proportional Matrices in Reals and Integers," Post-Print halshs-00585327, HAL.

    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:eee:matsoc:v:80:y:2016:i:c:p:25-32. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/inca/505565 .

    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.