An axiomatic derivation of Condorcet-consistent social decision rules
share
A social decision rule (SDR) is any non-empty set-valued map that associates any profile of individual preferences with the set of (winning) alternatives. An SDR is Condorcet-consistent if it selects the set of Condorcet winners whenever this later is non-empty. We propose a characterization of Condorcet consistent SDRs with a set of minimal axioms. It appears that all these rules satisfy a weaker Condorcet principle - the top consistency - which is not explicitly based on majority comparisons while all scoring rules fail to meet it. We also propose an alternative characterization of this class of rules using Maskin monotonicity.
READ FULL TEXT