Logo
Munich Personal RePEc Archive

An algorithmic approach to one-round electoral systems

Gutiérrez, José Manuel and Müller, Wolfgang C. (2016): An algorithmic approach to one-round electoral systems.

[thumbnail of MPRA_paper_73330.pdf]
Preview
PDF
MPRA_paper_73330.pdf

Download (739kB) | Preview

Abstract

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.

Atom RSS 1.0 RSS 2.0

Contact us: mpra@ub.uni-muenchen.de

This repository has been built using EPrints software.

MPRA is a RePEc service hosted by Logo of the University Library LMU Munich.