An algorithmic approach to one-round electoral systems

A family of algorithms provides a formalization of how the basic one-round electoral systems – highest average and largest remainders, single transferable vote and single non-transferable vote systems – proceed in transforming votes into seats. In this way, the basic one-round electoral systems are parametrized with the four parameters n (size of the constituency), m (size of the nomination lists), ck (a factor providing the electoral formula) and l (signed election threshold). The parametrization reveals that the most important electoral systems have a common basic structure.