IDEAS home Printed from https://ideas.repec.org/p/hal/journl/hal-05365555.html
   My bibliography  Save this paper

Desirability and social ranking

Author

Listed:
  • Michele Aleandri

    (LUISS - Libera Università Internazionale degli Studi Sociali Guido Carli [Roma])

  • Felix Fritz

    (LAMSADE - Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision - Université Paris Dauphine-PSL - PSL - Université Paris Sciences et Lettres - CNRS - Centre National de la Recherche Scientifique)

  • Stefano Moretti

    (LAMSADE - Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision - Université Paris Dauphine-PSL - PSL - Université Paris Sciences et Lettres - CNRS - Centre National de la Recherche Scientifique)

Abstract

We present an axiomatic study of various solutions to the social ranking problem, where a solution links any ranking of coalitions of players to a binary relation between individual players. We focus on solutions that align with the desirability relation, asserting that player i is more desirable than player j if any coalition including i but not j ranks higher than the corresponding coalition formed by replacing i with j. Unlike previous characterizations, our study highlights the central role of the desirability property as a foundational axiom in the characterization of five solutions from the related literature: Ceteris Paribus majority, lexicographic excellence and its dual, L (1) solution and its dual. Our main results reveal additional similarities among these five solutions and emphasize the essential features that should be considered when selecting the most appropriate solution for a given scenario. A practical application involving a bicameral legislature is also presented.

Suggested Citation

  • Michele Aleandri & Felix Fritz & Stefano Moretti, 2025. "Desirability and social ranking," Post-Print hal-05365555, HAL.
    • Handle: RePEc:hal:journl:hal-05365555
    DOI: 10.1007/s00355-025-01590-1
    Note: View the original document on HAL open archive server: https://hal.science/hal-05365555v1
    as

    Download full text from publisher

    File URL: https://hal.science/hal-05365555v1/document
    Download Restriction: no
    File URL: https://libkey.io/10.1007/s00355-025-01590-1?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:hal:journl:hal-05365555. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: CCSD (email available below). General contact details of provider: https://hal.archives-ouvertes.fr/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.