find_divisor

Find a divisor between <code>divisor_from</code> and <code>divisor_to</code> such that
<code>sum(round_func(votes/divisor))</code> equals <code>target_seats</code>

internal

Calculate seat apportionment for legislative bodies with
various methods. The algorithms include divisor or highest averages methods
(e.g. Jefferson, Webster or Adams), largest remainder methods and
biproportional apportionment.
Gaffke, N. & Pukelsheim, F. (2008) <doi:10.1016/j.mathsocsci.2008.01.004>
Oelbermann, K. F. (2016) <doi:10.1016/j.mathsocsci.2016.02.003>.

Flavio Poletti

proporz

Proportional Apportionment

find_divisor function

<dl><dt>votes</dt>
<dd>Votes (matrix with only one column or row, allows to use row/colnames
within <code>round_func</code>)</dd>
<dt>divisor_from</dt>
<dd>Lower bound for divisor search range (is decreased if necessary)</dd>
<dt>divisor_to</dt>
<dd>Upper bound for divisor search range (is increased if necessary)</dd>
<dt>target_seats</dt>
<dd>Number of seats to distribute (single number)</dd>
<dt>round_func</dt>
<dd>Rounding function</dd></dl>

Arguments

Find divisor to assign seats — find_divisor

<dl>

<dt>votes</dt>
<dd>Votes (matrix with only one column or row, allows to use row/colnames
within <code>round_func</code>)</dd>


<dt>divisor_from</dt>
<dd>Lower bound for divisor search range (is decreased if necessary)</dd>


<dt>divisor_to</dt>
<dd>Upper bound for divisor search range (is increased if necessary)</dd>


<dt>target_seats</dt>
<dd>Number of seats to distribute (single number)</dd>


<dt>round_func</dt>
<dd>Rounding function</dd>

</dl>

find_divisor: Find divisor to assign seats

Description

Usage

Value

Arguments