IDEAS home Printed from https://ideas.repec.org/a/kap/theord/v98y2025i2d10.1007_s11238-024-10006-y.html
   My bibliography  Save this article

Sabotage-proof social ranking solutions

Author

Listed:
  • Takahiro Suzuki

    (The University of Tokyo)

  • Masahide Horita

    (The University of Tokyo)

Abstract

Robustness against strategic manipulation is a crucial topic in social choice theory. Under some social ranking solutions (SRSs), namely mappings that yield candidates’ ranking from their coalitions’ ranking, candidates can sometimes improve their own social ranking by strategically degrading the coalitions to which they belong (e.g., sabotaging the coalitions to which the candidates and their competitors both belong could damage their competitors’ social rankings). This study investigates SRSs that can prevent such sabotage and promote sincere cooperation between candidates. To this end, we introduce two axioms of SRSs by modifying the non-manipulability (NM) in the literature. An SRS is sabotage-proof (SP) if no candidate can improve their social ranking against anyone else through sabotage, and it is strongly sabotage-proof (SSP) if it is SP and is endowed with a sanction system against specific sabotage. We first demonstrate that the ceteris paribus majority (when there are at least four candidates) and lexicographic excellence solutions are SP but not SSP. We then propose a new characterization of dual lexicographic excellence solution as the unique linear SRS satisfying SSP and coalitional anonymity. Our axiomatic study provides a theoretical ground that lexicographic evaluation of coalitional performances is highly robust against strategic sabotage.

Suggested Citation

  • Takahiro Suzuki & Masahide Horita, 2025. "Sabotage-proof social ranking solutions," Theory and Decision, Springer, vol. 98(2), pages 205-224, March.
    • Handle: RePEc:kap:theord:v:98:y:2025:i:2:d:10.1007_s11238-024-10006-y
    DOI: 10.1007/s11238-024-10006-y
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s11238-024-10006-y
    File Function: Abstract
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s11238-024-10006-y?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    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:kap:theord:v:98:y:2025:i:2:d:10.1007_s11238-024-10006-y. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.