Skip to main content

Algorithms for Biproportional Apportionment

  • Conference paper
Mathematics and Democracy

Part of the book series: Studies in Choice and Welfare ((WELFARE))

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • Bacharach, Michael (1970): Biproportional Matrices & Input-Output Change. Cambridge UK.

    Google Scholar 

  • Balinski, Michel L. and Demange, Gabrielle (1989a): An axiomatic approach to proportionality between matrices. Mathematics of Operations Research, 14:700–719.

    Article  MathSciNet  Google Scholar 

  • Balinski, Michel L. and Demange, Gabrielle (1989b): Algorithms for proportional matrices in reals and integers. Mathematical Programming, 45:193–210.

    Article  MathSciNet  Google Scholar 

  • Balinski, Michel L. and Pukelsheim, Friedrich (2006): Matrices and politics. In E. Liski, S. Puntanen J. Isotalo, and G. P. H. Styan, editors, Festschrift for Tarmo Pukkila on His 60th Birthday. Department of Mathematics, Statistics, and Philosophy: Tampere.

    Google Scholar 

  • Balinski, Michel L. and Rachev, Svetlozar T. (1997). Rouding proportions: Methods of rounding. Mathematical Scientist, 22:1–26.

    MathSciNet  Google Scholar 

  • Deming, W. Edwards and Stephan, Frederick F. (1940). On a least squares adjustment of a sample frequency table when the expected marginal totals are known. Annals of Mathematical. Statistics, 11:427–440.

    MathSciNet  Google Scholar 

  • Dorfleitner, Gregor and Klein, Thomas (1999). Rounding with multiplier methods: An efficient algorithm and applications in statistics. Statistical Papers, 20:143–157.

    Article  MathSciNet  Google Scholar 

  • Fienberg, Stephan S. and Meyer, Michael M. (1983): Iterative proportional fitting. In Encyclopedia. of Statistical Sciences, volume 4, pages 275–279. John Wiley & Sons.

    Google Scholar 

  • Ireland, C. T. and Kullback, S. (1968): Contingency tables with given marginals. Biometrika, 55(1):179–188.

    PubMed  CAS  MathSciNet  Google Scholar 

  • Joas, Bianca (2005): A graph theoretic solvability check for biproportional multiplier methods. Diploma Thesis, Institute of Mathematics, University of Augsburg.

    Google Scholar 

  • Marshall, Albert W. and Olkin, Ingram (1968) Scaling of matrices to achieve specified row and column sums. Numerische Mathematik, 12:83–90.

    Article  MathSciNet  Google Scholar 

  • Pretzel, Oliver (1980): Convergence of the interative scaling procedure for non-negative matrices. Journal of the London Mathematical Society, 21:379–384.

    MathSciNet  Google Scholar 

  • Pukelsheim, Friedrich (2004): BAZI-a java programm for proportional representation. In Oberwolfach. Reports, volume 1, pages 735–737.

    MathSciNet  Google Scholar 

  • Pukelsheim, Friedrich (2006): Current issues of apportionment methods. In Bruno Simeone and Friedrich Pukelsheim, editors, Mathematics and Democracy. Recent Advances in Voting. Systems and Collective Choice. New York, 2006.

    Google Scholar 

  • Pukelsheim, Friedrich and Schuhmacher, Christian (2004): Das neue Zürcher Zuteilungsverfahren bei Parlamentswahlen. Aktuelle Juristische Praxis-Pratique Juridique Actuelle, 13:505–522.

    Google Scholar 

  • Zachariasen, Martin (2006): Alorithmic aspects of divisor-based biproportional rounding. Typescript, April 2006.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer Berlin · Heidelberg

About this paper

Cite this paper

Maier, S. (2006). Algorithms for Biproportional Apportionment. In: Simeone, B., Pukelsheim, F. (eds) Mathematics and Democracy. Studies in Choice and Welfare. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-35605-3_8

Download citation

Publish with us

Policies and ethics