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 paper investigates the strategic implications of the uniform rank-minimizing mechanism (URM), an assignment rule that selects uniformly from the set of deterministic assignments minimizing the sum of agents' reported ranks. We focus on settings in which agents may refuse their assignment and instead receive an outside option. Without the refusal option, we show that truth-telling is not strictly dominated under any fair rank-minimizing mechanism; that is, one satisfying equal treatment of equals. However, introducing the refusal option significantly changes strategic incentives: specific manipulations, called outside option demotion strategies, dominate truth-telling under the URM. Moreover, such manipulations can lead to inefficient outcomes, as desirable objects may be refused by misreporting agents and consequently remain unassigned. To address this issue, we propose a modification of the URM that restores undominated truth-telling, although it introduces incentives to underreport acceptable objects. Our results highlight a fundamental trade-off in the design of fair rank-minimizing mechanisms when agents can refuse their assignments.

Suggested Citation

  • Yasunori Okumura, 2024. "Strategic Analysis of Fair Rank-Minimizing Mechanisms with Agent Refusal Option," Papers 2408.01673, arXiv.org, revised Sep 2025.
  • 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
    ---><---

    References listed on IDEAS

    as
    1. Kojima, Fuhito & Manea, Mihai, 2010. "Incentives in the probabilistic serial mechanism," Journal of Economic Theory, Elsevier, vol. 145(1), pages 106-123, January.
    2. Bogomolnaia, Anna & Moulin, Herve, 2001. "A New Solution to the Random Assignment Problem," Journal of Economic Theory, Elsevier, vol. 100(2), pages 295-328, October.
    3. Doğan, Battal & Yenmez, M. Bumin, 2019. "Unified versus divided enrollment in school choice: Improving student welfare in Chicago," Games and Economic Behavior, Elsevier, vol. 118(C), pages 366-373.
    4. Ortega, Josué & Klein, Thilo, 2023. "The cost of strategy-proofness in school choice," Games and Economic Behavior, Elsevier, vol. 141(C), pages 515-528.
    5. Troyan, Peter, 2024. "(Non-)obvious manipulability of rank-minimizing mechanisms," Journal of Mathematical Economics, Elsevier, vol. 113(C).
    6. Nikzad, Afshin, 2022. "Rank-optimal assignments in uniform markets," Theoretical Economics, Econometric Society, vol. 17(1), January.
    7. Eric Budish & Yeon-Koo Che & Fuhito Kojima & Paul Milgrom, 2013. "Designing Random Allocation Mechanisms: Theory and Applications," American Economic Review, American Economic Association, vol. 103(2), pages 585-623, April.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Ivan Balbuzanov, 2016. "Convex strategyproofness with an application to the probabilistic serial mechanism," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 46(3), pages 511-520, March.
    2. Shende, Priyanka & Purohit, Manish, 2023. "Strategy-proof and envy-free mechanisms for house allocation," Journal of Economic Theory, Elsevier, vol. 213(C).
    3. Andrew McLennan & Shino Takayama & Yuki Tamura, 2024. "An Efficient, Computationally Tractable School Choice Mechanism," Discussion Papers Series 668, School of Economics, University of Queensland, Australia.
    4. Th`anh Nguyen & Alexander Teytelboym & Shai Vardi, 2025. "Efficiency, Envy, and Incentives in Combinatorial Assignment," Papers 2509.13198, arXiv.org, revised Oct 2025.
    5. Yajing Chen & Patrick Harless & Zhenhua Jiao, 2024. "The fractional Boston random assignment rule and its axiomatic characterization," Review of Economic Design, Springer;Society for Economic Design, vol. 28(1), pages 21-43, February.
    6. Onur Kesten & Morimitsu Kurino & Alexander S. Nesterov, 2017. "Efficient lottery design," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 48(1), pages 31-57, January.
    7. Marek Bojko, 2020. "The Probabilistic Serial and Random Priority Mechanisms with Minimum Quotas," Papers 2012.11028, arXiv.org.
    8. Mennle, Timo & Seuken, Sven, 2021. "Partial strategyproofness: Relaxing strategyproofness for the random assignment problem," Journal of Economic Theory, Elsevier, vol. 191(C).
    9. Nguyen, Thành & Peivandi, Ahmad & Vohra, Rakesh, 2016. "Assignment problems with complementarities," Journal of Economic Theory, Elsevier, vol. 165(C), pages 209-241.
    10. Jingsheng Yu & Jun Zhang, 2020. "Efficient and fair trading mechanisms for resource exchange in market design," Papers 2005.06878, arXiv.org, revised Aug 2025.
    11. Yinghua He & Antonio Miralles & Marek Pycia & Jianye Yan, 2018. "A Pseudo-Market Approach to Allocation with Priorities," American Economic Journal: Microeconomics, American Economic Association, vol. 10(3), pages 272-314, August.
    12. Balbuzanov, Ivan, 2022. "Constrained random matching," Journal of Economic Theory, Elsevier, vol. 203(C).
    13. Jugal Garg & Yixin Tao & L'aszl'o A. V'egh, 2025. "Tight Efficiency Bounds for the Probabilistic Serial Mechanism under Cardinal Preferences," Papers 2507.03359, arXiv.org.
    14. Afacan, Mustafa Oǧuz, 2018. "The object allocation problem with random priorities," Games and Economic Behavior, Elsevier, vol. 110(C), pages 71-89.
    15. Haris Aziz & Yoichi Kasajima, 2017. "Impossibilities for probabilistic assignment," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 49(2), pages 255-275, August.
    16. Eduardo M Azevedo & Eric Budish, 2019. "Strategy-proofness in the Large," The Review of Economic Studies, Review of Economic Studies Ltd, vol. 86(1), pages 81-116.
    17. Wonki Jo Cho, 2018. "Probabilistic assignment: an extension approach," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 51(1), pages 137-162, June.
    18. Troyan, Peter, 2024. "(Non-)obvious manipulability of rank-minimizing mechanisms," Journal of Mathematical Economics, Elsevier, vol. 113(C).
    19. Miralles, Antonio & Pycia, Marek, 2021. "Foundations of pseudomarkets: Walrasian equilibria for discrete resources," Journal of Economic Theory, Elsevier, vol. 196(C).
    20. Bogomolnaia, Anna & Moulin, Herve, 2015. "Size versus fairness in the assignment problem," Games and Economic Behavior, Elsevier, vol. 90(C), pages 119-127.

    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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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.