Composition-consistent tournament solutions and social choice functions

This paper introduces a new axiom for choice in preference profiles and tournaments, called composition-consistency. A social choice function is composition-consistent if it is non-sensitive to the cloning of one or several outcomes. The key feature of the composition consistency property is an operation concept called multiple composition product of profiles. The paper provides a brief overview of some social choice functions studied in the literature. Concerning the tournament solutions, it is proved that the Top Cycle, the Slater and the Copeland solutions are not composition-consistent, whereas the Banks, Uncovered Set, TEQ, Minimal Covering Set are composition-consistent. Moreover, we define the composition-consistent hull of a solution as the smallest composition-consistent solution containing . The composition-consistent hulls of the Top cycle and Copeland solutions are specified, and we give some hints about the location of the hull of the Slater set. Concerning social choice functions, it is shown that Kemeny, Borda and Minimax social choice functions are not composition-consistent, whereas the Paretian one is composition-consistent. Moreover, we prove that the latter is the composition-consistent hull of the Borda and Minimax functions.