Desirability and social rankings
Michele Aleandri, Felix Fritz, Stefano Moretti
TL;DR
This paper studies how to convert the partial desirability relation among players in multi-valued coalitional games into a total social ranking by axiomatizing several existing solutions. It provides unique characterizations for five social-ranking solutions—CP-majority, lex-cel, dual-lex, $L^{(1)}$, and $L^{(1)}_*$—via independent axiom sets that encode ceteris paribus comparisons, neutrality, anonymity, and coalition-size effects. The results reveal structural similarities and differences among the solutions, and a case study on a bicameral legislature demonstrates the practical implications of the axioms for ranking political parties. The analysis offers guidance on selecting a ranking method based on how strongly one wants to reward excellence in top coalitions versus considering the stability of CP-comparisons across coalition configurations.
Abstract
In coalitional games, a player $i$ is regarded as strictly more desirable than player $j$ if substituting $j$ with $i$ within any coalition leads to a strict augmentation in the value of certain coalitions, while preserving the value of the others. We adopt a property-driven approach to 'integrate' the notion of the desirability relation into a total relation by establishing sets of independent axioms leading to the characterization of solutionconcepts from the related literature. We focus on social ranking solutions consistent with the desirability relation and propose complementary sets of properties for the axiomatic characterization of five existing solutions: Ceteris Paribus (CP-)majority, lexicographic excellence (lex-cel), dual-lex, $L^{(1)}$ solution and its dual version $L^{(1)}_{*}$ . These characterizations reveal additional similarities among the five solutions and emphasize the essential characteristics that should be taken into account when selecting a social ranking. A practical scenario involving a bicameral legislature is studied.
