2021/11/29 by Yonta, Aurelien Mekuko, Núñez, Matias, Moyouwou, Issofa +1
#Combinatorics (math.CO) #Computer Science and Game Theory (cs.GT) #FOS: Computer and information sciences #FOS: Mathematics
paper · doi:10.48550/arxiv.2111.14417
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.