Restos_Mayores: Largest remainder method

Description Usage Arguments Value See Also Examples

View source: R/Reparto_Escanos.R

Description

This function is used to translate votes into seats, following the criterion called "Largest Remains". In summary, this method is calculated as follows: the total number of votes is divided by the total number of seats (cost of each seat). The votes of each party are then divided by the above ratio. The integer part of the above results are taken, which will be the initial seats for each party. The remaining seats to be distributed are allocated to the parties with the largest remainders (see https://en.wikipedia.org/wiki/Largest_remainder_method ).

The cost of each seat is what differentiates one method from another. Thus if n is the total number of seats and m the sum of all votes, the denomination of the methods is as follows, depending on the ratio that is taken:

  1. Hare (Hare): q=m/n

  2. Droop (Droop):q=1+(m/(1+n))

  3. Imperiali (Imperiali): q=m/(n+2)

  4. Imperiali modificado (Mod_Imperiali): q=m/(n+3)

  5. Hangenbach Bischof (hangenbach-bischo): q=m/(n+1)

In all cases the value of q is rounded to the nearest integer.

Usage

1
Restos_Mayores(partidos, votos, escanos, metodo = "Hare")

Arguments

partidos

A character vector containing the name of the parties.

votos

An integer vector with the votes of each party.

escanos

An integer number containing the total number of seats to be allocated.

metodo

This is the method to be used. The allowed values are: "Hare", "Droop", "Imperiali", "Mod_Imperiali", "hangenbach-bischo". The default value is "Hare".

Value

A dataframe with the political parties and the votes assigned to each.

See Also

reparto_div for the allocation using divisor method

https://en.wikipedia.org/wiki/Largest_remainder_method on Wikipedia.

reparto_div

Examples

1
2
3
Restos_Mayores(c("A","B","C","D","E","F","G"),
 c(391000,311000,184000,73000,27000,12000,2000),
 21,metodo = "Imperiali")

Relectoral documentation built on July 2, 2020, 2:31 a.m.