Characterizations of approval ranking

Hiroyuki Komatsu

Mathematical Social Sciences, 2024, vol. 128, issue C, 18-24

Abstract: In this paper, we consider those voting situations in which each voter decides whether he or she approves each candidate. Given a list of such approvals, a “social preference function” picks a ranking of the candidates. We are interested in finding out which social preference functions are non-manipulable. We show that a particular social preference function, referred to as approval ranking, is more decisive than any other social preference functions satisfying completeness, neutrality, anonymity, and non-manipulability. In addition, we show that approval ranking is axiomatized by these four axioms and tie-breakability.

Keywords: Approval voting; Strategy-proofness; Voting rule; Characterization; Social preference (search for similar items in EconPapers)
Date: 2024
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0165489624000076
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:matsoc:v:128:y:2024:i:c:p:18-24

DOI: 10.1016/j.mathsocsci.2024.01.001

Access Statistics for this article

Mathematical Social Sciences is currently edited by J.-F. Laslier

More articles in Mathematical Social Sciences from Elsevier
Bibliographic data for series maintained by Catherine Liu ().