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

Random Serial Dictatorship with Transfers

Author

Listed:
  • Sudharsan Sundar
  • Eric Gao
  • Trevor Chow
  • Matthew Ding

Abstract

It is well known that Random Serial Dictatorship is strategy-proof and leads to a Pareto-Efficient outcome. We show that this result breaks down when individuals are allowed to make transfers, and adapt Random Serial Dictatorship to encompass trades between individuals. Strategic analysis of play under the new mechanisms we define is given, accompanied by simulations to quantify the gains from trade.

Suggested Citation

  • Sudharsan Sundar & Eric Gao & Trevor Chow & Matthew Ding, 2023. "Random Serial Dictatorship with Transfers," Papers 2312.07999, arXiv.org.
    • Handle: RePEc:arx:papers:2312.07999
    as

    Download full text from publisher

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

    References listed on IDEAS

    as
    1. Atila Abdulkadiroglu & Tayfun Sonmez, 1998. "Random Serial Dictatorship and the Core from Random Endowments in House Allocation Problems," Econometrica, Econometric Society, vol. 66(3), pages 689-702, May.
    2. ,, 2015. "Serial dictatorship: the unique optimal allocation rule when information is endogenous," Theoretical Economics, Econometric Society, vol. 10(2), May.
    3. Bettina Klaus & Alexandru Nichifor, 2021. "Serial dictatorship mechanisms with reservation prices: heterogeneous objects," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 57(1), pages 145-162, July.
    4. Bettina Klaus & Alexandru Nichifor, 2020. "Serial dictatorship mechanisms with reservation prices," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 70(3), pages 665-684, October.
    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. SHINOZAKI, Hiroki, 2024. "Shill-proof rules in object allocation problems with money," Discussion paper series HIAS-E-137, Hitotsubashi Institute for Advanced Study, Hitotsubashi University.
    2. Sophie Bade, 2016. "Pareto-optimal matching allocation mechanisms for boundedly rational agents," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 47(3), pages 501-510, October.
    3. Hiroki Shinozaki, 2022. "Characterizing pairwise strategy-proof rules in object allocation problems with money," ISER Discussion Paper 1187, Institute of Social and Economic Research, The University of Osaka.
    4. Rustamdjan Hakimov & Dorothea Kübler & Siqi Pan, 2023. "Costly information acquisition in centralized matching markets," Quantitative Economics, Econometric Society, vol. 14(4), pages 1447-1490, November.
    5. Raghavan, Madhav, 2020. "Swap-flexibility in the assignment of houses," Journal of Mathematical Economics, Elsevier, vol. 91(C), pages 1-10.
    6. Dasgupta, Sulagna, 2024. "Designing information to improve welfare in matching markets," Mathematical Social Sciences, Elsevier, vol. 131(C), pages 5-16.
    7. Felix Brandt & Patrick Lederer & René Romen, 2024. "Relaxed notions of Condorcet-consistency and efficiency for strategyproof social decision schemes," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 63(1), pages 19-55, August.
    8. Zhiwei Cui & Yan-An Hwang, 2017. "House exchange and residential segregation in networks," International Journal of Game Theory, Springer;Game Theory Society, vol. 46(1), pages 125-147, March.
    9. Takamiya, Koji, 2001. "Coalition strategy-proofness and monotonicity in Shapley-Scarf housing markets," Mathematical Social Sciences, Elsevier, vol. 41(2), pages 201-213, March.
    10. Ivan Balbuzanov & Maciej H. Kotowski, 2019. "Endowments, Exclusion, and Exchange," Econometrica, Econometric Society, vol. 87(5), pages 1663-1692, September.
    11. SangMok Lee, 2022. "Preference Learning in School Choice Problems," Papers 2202.08366, arXiv.org, revised Mar 2023.
    12. Bogomolnaia, Anna & Moulin, Herve, 2015. "Size versus fairness in the assignment problem," Games and Economic Behavior, Elsevier, vol. 90(C), pages 119-127.
    13. Sonmez, Tayfun & Utku Unver, M., 2005. "House allocation with existing tenants: an equivalence," Games and Economic Behavior, Elsevier, vol. 52(1), pages 153-185, July.
    14. Ethem Akyol, 2025. "Allocation without transfers: a welfare-maximizing mechanism under incomplete information," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 64(3), pages 603-632, May.
    15. Bade, Sophie, 2011. "Matching Allocation Problems with Endogenous Information Acquisition," VfS Annual Conference 2011 (Frankfurt, Main): The Order of the World Economy - Lessons from the Crisis 48735, Verein für Socialpolitik / German Economic Association.
    16. Kyle Bagwell & Robert W. Staiger, 2018. "Multilateral Trade Bargaining And Dominant Strategies," International Economic Review, Department of Economics, University of Pennsylvania and Osaka University Institute of Social and Economic Research Association, vol. 59(4), pages 1785-1824, November.
    17. Bettina Klaus & David F. Manlove & Francesca Rossi, 2014. "Matching under Preferences," Cahiers de Recherches Economiques du Département d'économie 14.07, Université de Lausanne, Faculté des HEC, Département d’économie.
    18. Hosseinzadeh Ranjbar, Homa & Feizi, Mehdi, 2025. "Credibility of group manipulation in random assignments," Games and Economic Behavior, Elsevier, vol. 150(C), pages 27-33.
    19. Han, Xiang, 2024. "On the efficiency and fairness of deferred acceptance with single tie-breaking," Journal of Economic Theory, Elsevier, vol. 218(C).
    20. Marek Pycia & Peter Troyan, 2023. "A Theory of Simplicity in Games and Mechanism Design," Econometrica, Econometric Society, vol. 91(4), pages 1495-1526, July.

    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:2312.07999. 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.