Economics at your fingertips  

Dilemma with approval and disapproval votes

Stéphane Gonzalez (), Annick Laruelle () and Philippe Solal
Additional contact information
Stéphane Gonzalez: Université de Saint-Etienne, UMR 5824 GATE Lyon Saint-Etienne

Social Choice and Welfare, 2019, vol. 53, issue 3, 497-517

Abstract: Abstract This paper looks at the issue of selecting candidates when the votes cast in ballots enable voters to approve or disapprove each candidate. More precisely, three options are offered: voters can approve, disapprove or remain neutral in regard to each candidate. We define a large family of rules that satisfy desirable properties and prove that solving a dilemma is sufficient to characterize any rule which belongs to this family. In this context a dilemma appears when candidates with only neutral votes face candidates with both supporters and opponents. On the basis of this result, we provide comparable axiomatizations of four rules including some proposed in the literature.

Date: 2019
References: Add references at CitEc
Citations: Track citations by RSS feed

Downloads: (external link) Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
Working Paper: Dilemma with approval and disapproval votes (2019)
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:

Ordering information: This journal article can be ordered from
http://www.springer. ... c+theory/journal/355

DOI: 10.1007/s00355-019-01194-6

Access Statistics for this article

Social Choice and Welfare is currently edited by Bhaskar Dutta, Marc Fleurbaey, Elizabeth Maggie Penn and Clemens Puppe

More articles in Social Choice and Welfare from Springer, The Society for Social Choice and Welfare Contact information at EDIRC.
Bibliographic data for series maintained by Sonal Shukla ().

Page updated 2020-03-29
Handle: RePEc:spr:sochwe:v:53:y:2019:i:3:d:10.1007_s00355-019-01194-6