Are Condorcet procedures so bad according to the reinforcement axiom?
Sébastien Courtin,
Boniface Mbih and
Issofa Moyouwou ()
Social Choice and Welfare, 2014, vol. 42, issue 4, 927-940
Abstract:
A Condorcet social choice procedure elects the candidate that beats every other candidate under simple majority when such a candidate exists. The reinforcement axiom roughly states that given two groups of individuals, if these two groups select the same alternative, then this alternative must also be selected by their union. Condorcet social choice procedures are known to violate this axiom. Our goal in this paper is to put this important voting theory result into perspective. We then proceed by evaluating how frequently this phenomenon is susceptible to occur. Copyright Springer-Verlag Berlin Heidelberg 2014
Date: 2014
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (3)
Downloads: (external link)
http://hdl.handle.net/10.1007/s00355-013-0758-7 (text/html)
Access to full text is restricted to subscribers.
Related works:
Working Paper: Are Condorcet procedures so bad according to the reinforcement axiom? (2014) 
Working Paper: Are Condorcet procedures so bad according to the reinforcement axiom? (2012) 
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:spr:sochwe:v:42:y:2014:i:4:p:927-940
Ordering information: This journal article can be ordered from
http://www.springer. ... c+theory/journal/355
DOI: 10.1007/s00355-013-0758-7
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 () and Springer Nature Abstracting and Indexing ().