Algorithms for Biproportional Apportionment

Sebastian Maier
Additional contact information
Sebastian Maier: Universität Augsburg

A chapter in Mathematics and Democracy, 2006, pp 105-116 from Springer

Abstract: 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.

Keywords: Biproportional divisor method; biproportional rounding algorithm; discrete alternating scaling; tie-and-transfer algorithm; BAZI (search for similar items in EconPapers)
Date: 2006
References: Add references at CitEc
Citations: View citations in EconPapers (3)

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

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:spr:stcchp:978-3-540-35605-9_8

Ordering information: This item can be ordered from
http://www.springer.com/9783540356059

DOI: 10.1007/3-540-35605-3_8

Access Statistics for this chapter

More chapters in Studies in Choice and Welfare from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().