IDEAS home Printed from https://ideas.repec.org/a/eee/mateco/v113y2024ics0304406824000752.html
   My bibliography  Save this article

(Non-)obvious manipulability of rank-minimizing mechanisms

Author

Listed:
  • Troyan, Peter

Abstract

In assignment problems, the rank distribution of assigned objects is often used to evaluate match quality. Rank-minimizing (RM) mechanisms directly optimize for average rank. While appealing, a drawback is RM mechanisms are not strategyproof. This paper investigates whether RM satisfies the weaker incentive notion of non-obvious manipulability (NOM, Troyan and Morrill, 2020). I show any RM mechanism with full support — placing positive probability on all rank-minimizing allocations — is NOM. In particular, uniform randomization satisfies this condition. Without full support, whether an RM mechanism is NOM or not depends on the details of the selection rule.

Suggested Citation

  • Troyan, Peter, 2024. "(Non-)obvious manipulability of rank-minimizing mechanisms," Journal of Mathematical Economics, Elsevier, vol. 113(C).
    • Handle: RePEc:eee:mateco:v:113:y:2024:i:c:s0304406824000752
    DOI: 10.1016/j.jmateco.2024.103015
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0304406824000752
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.jmateco.2024.103015?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.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Yasunori Okumura, 2024. "Strategic Analysis of Fair Rank-Minimizing Mechanisms with Agent Refusal Option," Papers 2408.01673, arXiv.org, revised Sep 2024.

    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:eee:mateco:v:113:y:2024:i:c:s0304406824000752. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/jmateco .

    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.