Abstract (EN)

In this paper we study the problem of selecting the most relevant elements of a finite set N of elements from a ranking of non-empty subsets of N, that represents the performance of different coalitions. To solve this problem, we first introduce the notion of coalitional social choice function (i.e., a map that associates each total preorder of the non-empty subsets of N with a subset of N). Then, we provide four basic properties that a coalitional social choice function should satisfy to select the most relevant elements. Finally, we prove that the unique coalitional social choice function that satisfies such properties is the one selecting the elements ranked in the highest position of the lexicographic excellence ranking, which is computed according to a social ranking solution from the literature.