IDEAS home Printed from https://ideas.repec.org/p/arx/papers/2408.01673.html
   My bibliography  Save this paper

Strategic Analysis of Fair Rank-Minimizing Mechanisms with Agent Refusal Option

Author

Listed:
  • Yasunori Okumura

Abstract

This study examines strategic issues in fair rank-minimizing mechanisms, which choose an assignment that minimizes the average rank of object types to which agents are assigned and satisfy a fairness property called equal treatment of equals. As one of these fair mechanisms, the uniform rank-minimizing mechanism is considered. We focus on the case where agents can refuse their assignment and obtain the outside option instead. Without the refusal option, truth-telling is not strategically dominated by any strategies if a fair rank-minimizing mechanism is used. However, if agents have the option and the uniform rank-minimizing mechanism is used, then a strategy called an outside option demotion strategy strategically dominates truth-telling. Moreover, we show that adopting this strategy may lead to inefficient assignments. To counter this, we propose a modification of the uniform rank-minimizing mechanism, though it may lead agents to strategically reduce the number of acceptable types.

Suggested Citation

  • Yasunori Okumura, 2024. "Strategic Analysis of Fair Rank-Minimizing Mechanisms with Agent Refusal Option," Papers 2408.01673, arXiv.org, revised Sep 2024.
  • Handle: RePEc:arx:papers:2408.01673
    as

    Download full text from publisher

    File URL: http://arxiv.org/pdf/2408.01673
    File Function: Latest version
    Download Restriction: no
    ---><---

    More about this item

    NEP fields

    This paper has been announced in the following NEP Reports:

    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:arx:papers:2408.01673. 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: arXiv administrators (email available below). General contact details of provider: http://arxiv.org/ .

    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.