IDEAS home Printed from https://ideas.repec.org/p/arx/papers/2602.01224.html

The Domain of RSD Characterization by Efficiency, Symmetry, and Strategy-Proofness

Author

Listed:
  • Maor Ben Zaquen
  • Ron Holzman

Abstract

Given a set of $n$ individuals with strict preferences over $m$ indivisible objects, the Random Serial Dictatorship (RSD) mechanism is a method for allocating objects to individuals in a way that is efficient, fair, and incentive-compatible. A random order of individuals is first drawn, and each individual, following this order, selects their most preferred available object. The procedure continues until either all objects have been assigned or all individuals have received an object. RSD is widely recognized for its application in fair allocation problems involving indivisible goods, such as school placements and housing assignments. Despite its extensive use, a comprehensive axiomatic characterization has remained incomplete. For the balanced case $n=m=3$, Bogomolnaia and Moulin have shown that RSD is uniquely characterized by Ex-Post Efficiency, Equal Treatment of Equals, and Strategy-Proofness. The possibility of extending this characterization to larger markets had been a long-standing open question, which Basteck and Ehlers recently answered in the negative for all markets with $n,m\geq5$. This work completes the picture by identifying exactly for which pairs $\left(n,m\right)$ these three axioms uniquely characterize the RSD mechanism and for which pairs they admit multiple mechanisms. In the latter cases, we construct explicit alternatives satisfying the axioms and examine whether augmenting the set of axioms could rule out these alternatives.

Suggested Citation

  • Maor Ben Zaquen & Ron Holzman, 2026. "The Domain of RSD Characterization by Efficiency, Symmetry, and Strategy-Proofness," Papers 2602.01224, arXiv.org.
  • Handle: RePEc:arx:papers:2602.01224
    as

    Download full text from publisher

    File URL: http://arxiv.org/pdf/2602.01224
    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:2602.01224. 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.