Non-anonymous ballot aggregation: an axiomatic generalization of Approval Voting
Fecha
2013Versión
Acceso abierto / Sarbide irekia
Tipo
Artículo / Artikulua
Versión
Versión aceptada / Onetsi den bertsioa
Impacto
|
10.1016/j.jmateco.2013.09.004
Resumen
We study axiomatically situations in which the society agrees to treat voters with different characteristics distinctly. In this setting, we propose a set of intuitive axioms and show that they jointly characterize a new class of voting procedures, called Type-weighted Approval Voting. According to this family, each voter has a strictly positive and finite weight (the weight is necessarily the sa ...
[++]
We study axiomatically situations in which the society agrees to treat voters with different characteristics distinctly. In this setting, we propose a set of intuitive axioms and show that they jointly characterize a new class of voting procedures, called Type-weighted Approval Voting. According to this family, each voter has a strictly positive and finite weight (the weight is necessarily the same for all voters with the same characteristics) and the alternative with the highest number of weighted votes is elected. The implemented voting procedure reduces to Approval Voting in case all voters are identical or the procedure assigns the same weight to all types. Using this idea, we also obtain a new characterization of Approval Voting. [--]
Materias
Approval voting,
Characterization,
Anonymity
Editor
Elsevier
Publicado en
Journal of Mathematical Economics 50 (2014) 69-78
Departamento
Universidad Pública de Navarra. Departamento de Economía /
Nafarroako Unibertsitate Publikoa. Ekonomia Saila
Versión del editor
Entidades Financiadoras
The first author’s financial support from the Spanish Ministry of Education and Science, through the project ECO2012–34202, and Fundación Ramón Areces is gratefully acknowledged. The second author’s financial support from the Spanish Ministry of Education and Science, through the project ECO2012–31985, and Fundación Ramón Areces is gratefully acknowledged.