IDEAS home Printed from https://ideas.repec.org/a/inm/ormoor/v45y2020i1p353-368.html
   My bibliography  Save this article

Random Serial Dictatorship: The One and Only

Author

Listed:
  • Sophie Bade

    (Royal Holloway College, University of London, Egham TW20 0EX, United Kingdom; Max Planck Institute for Research on Collective Goods, 53113 Bonn, Germany)

Abstract

Fix a Pareto-optimal, strategy-proof, and nonbossy deterministic matching mechanism and define a random matching mechanism by assigning agents to the roles in the mechanism via a uniform lottery. Given a profile of preferences, the lottery over outcomes that arises under the random matching mechanism is identical to the lottery that arises under random serial dictatorship, where the order of dictators is uniformly distributed. This result extends the celebrated equivalence between the core from random endowments and random serial dictatorship to the grand set of all Pareto-optimal, strategy-proof, and nonbossy matching mechanisms.

Suggested Citation

  • Sophie Bade, 2020. "Random Serial Dictatorship: The One and Only," Mathematics of Operations Research, INFORMS, vol. 45(1), pages 353-368, February.
    • Handle: RePEc:inm:ormoor:v:45:y:2020:i:1:p:353-368
    DOI: 10.1287/moor.2019.0987
    as

    Download full text from publisher

    File URL: https://doi.org/10.1287/moor.2019.0987
    Download Restriction: no
    File URL: https://libkey.io/10.1287/moor.2019.0987?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
    ---><---

    References listed on IDEAS

    as
    1. Szilvia Papai, 2000. "Strategyproof Assignment by Hierarchical Exchange," Econometrica, Econometric Society, vol. 68(6), pages 1403-1434, November.
    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. Shapley, Lloyd & Scarf, Herbert, 1974. "On cores and indivisibility," Journal of Mathematical Economics, Elsevier, vol. 1(1), pages 23-37, March.
    4. Pycia, Marek & Unver, Utku, 2017. "Incentive compatible allocation and exchange of discrete resources," Theoretical Economics, Econometric Society, vol. 12(1), January.
    5. , A. & ,, 2011. "Lotteries in student assignment: An equivalence result," Theoretical Economics, Econometric Society, vol. 6(1), January.
    6. Daniela Saban & Jay Sethuraman, 2015. "The Complexity of Computing the Random Priority Allocation Matrix," Mathematics of Operations Research, INFORMS, vol. 40(4), pages 1005-1014, October.
    7. Carroll, Gabriel, 2014. "A general equivalence theorem for allocation of indivisible objects," Journal of Mathematical Economics, Elsevier, vol. 51(C), pages 163-177.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. Morrill, Thayer & Roth, Alvin E., 2024. "Top trading cycles," Journal of Mathematical Economics, Elsevier, vol. 112(C).
    2. Imamura, Kenzo & Kawase, Yasushi, 2024. "Efficient matching under general constraints," Games and Economic Behavior, Elsevier, vol. 145(C), pages 197-207.
    3. Mackenzie, Andrew & Zhou, Yu, 2022. "Menu mechanisms," Journal of Economic Theory, Elsevier, vol. 204(C).
    4. Christian Basteck, 2024. "An Axiomatization of the Random Priority Rule," Rationality and Competition Discussion Paper Series 502, CRC TRR 190 Rationality and Competition.
    5. Eirinakis, Pavlos & Mourtos, Ioannis & Zampou, Eleni, 2022. "Random Serial Dictatorship for horizontal collaboration in logistics," Omega, Elsevier, vol. 111(C).
    6. Felix Brandt & Matthias Greger & Ren'e Romen, 2023. "Towards a Characterization of Random Serial Dictatorship," Papers 2303.11976, arXiv.org, revised Jul 2024.
    7. Altuntaş, Açelya & Phan, William, 2022. "Trading probabilities along cycles," Journal of Mathematical Economics, Elsevier, vol. 100(C).
    8. Sophie Bade & Joseph Root, 2023. "Royal Processions: Incentives, Efficiency and Fairness in Two-sided Matching," Papers 2301.13037, arXiv.org.
    9. Xinghua Long & Rodrigo A. Velez, 2021. "Balanced House Allocation," Papers 2109.01992, arXiv.org.
    10. Tamura, Yuki & Hosseini, Hadi, 2022. "The crawler: Three equivalence results for object (re)allocation problems when preferences are single-peaked," Journal of Economic Theory, Elsevier, vol. 203(C).
    11. Raghavan, Madhav, 2020. "Swap-flexibility in the assignment of houses," Journal of Mathematical Economics, Elsevier, vol. 91(C), pages 1-10.
    12. Basteck, Christian, 2024. "An axiomatization of the random priority rule," Discussion Papers, Research Unit: Market Behavior SP II 2024-201, WZB Berlin Social Science Center.
    13. Basteck, Christian & Ehlers, Lars, 2024. "On (constrained) Efficiency of strategy-proof random assignment," VfS Annual Conference 2024 (Berlin): Upcoming Labor Market Challenges 302429, Verein für Socialpolitik / German Economic Association.

    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. Marek Pycia & Peter Troyan, 2023. "A Theory of Simplicity in Games and Mechanism Design," Econometrica, Econometric Society, vol. 91(4), pages 1495-1526, July.
    2. Patrick Harless & William Phan, 2020. "On endowments and indivisibility: partial ownership in the Shapley–Scarf model," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 70(2), pages 411-435, September.
    3. Morrill, Thayer & Roth, Alvin E., 2024. "Top trading cycles," Journal of Mathematical Economics, Elsevier, vol. 112(C).
    4. Marek Pycia & M. Utku Ünver, 2022. "Outside options in neutral allocation of discrete resources," Review of Economic Design, Springer;Society for Economic Design, vol. 26(4), pages 581-604, December.
    5. Xinghua Long & Rodrigo A. Velez, 2021. "Balanced House Allocation," Papers 2109.01992, arXiv.org.
    6. Monte, Daniel & Tumennasan, Norovsambuu, 2015. "Centralized allocation in multiple markets," Journal of Mathematical Economics, Elsevier, vol. 61(C), pages 74-85.
    7. Shende, Priyanka & Purohit, Manish, 2023. "Strategy-proof and envy-free mechanisms for house allocation," Journal of Economic Theory, Elsevier, vol. 213(C).
    8. 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.
    9. Liu, Peng & Zeng, Huaxia, 2019. "Random assignments on preference domains with a tier structure," Journal of Mathematical Economics, Elsevier, vol. 84(C), pages 176-194.
    10. Che, Yeon-Koo & Tercieux, Olivier, 2018. "Payoff equivalence of efficient mechanisms in large matching markets," Theoretical Economics, Econometric Society, vol. 13(1), January.
    11. Thayer Morrill, 2015. "Two simple variations of top trading cycles," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 60(1), pages 123-140, September.
    12. Christian Basteck, 2024. "An Axiomatization of the Random Priority Rule," Rationality and Competition Discussion Paper Series 502, CRC TRR 190 Rationality and Competition.
    13. Ekici, Özgün, 2020. "Random mechanisms for house allocation with existing tenants," Journal of Mathematical Economics, Elsevier, vol. 89(C), pages 53-65.
    14. Carroll, Gabriel, 2014. "A general equivalence theorem for allocation of indivisible objects," Journal of Mathematical Economics, Elsevier, vol. 51(C), pages 163-177.
    15. Tamura, Yuki & Hosseini, Hadi, 2022. "The crawler: Three equivalence results for object (re)allocation problems when preferences are single-peaked," Journal of Economic Theory, Elsevier, vol. 203(C).
    16. Altuntaş, Açelya & Phan, William, 2022. "Trading probabilities along cycles," Journal of Mathematical Economics, Elsevier, vol. 100(C).
    17. Hashimoto, Tadashi & Hirata, Daisuke & Kesten, Onur & Kurino, Morimitsu & Unver, Utku, 2014. "Two axiomatic approaches to the probabilistic serial mechanism," Theoretical Economics, Econometric Society, vol. 9(1), January.
    18. Nesterov, Alexander S., 2017. "Fairness and efficiency in strategy-proof object allocation mechanisms," Journal of Economic Theory, Elsevier, vol. 170(C), pages 145-168.
    19. Basteck, Christian, 2024. "An axiomatization of the random priority rule," Discussion Papers, Research Unit: Market Behavior SP II 2024-201, WZB Berlin Social Science Center.
    20. Ivan Balbuzanov & Maciej H. Kotowski, 2019. "Endowments, Exclusion, and Exchange," Econometrica, Econometric Society, vol. 87(5), pages 1663-1692, September.

    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:inm:ormoor:v:45:y:2020:i:1:p:353-368. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.