IDEAS home Printed from https://ideas.repec.org/a/spr/reecde/v28y2024i1d10.1007_s10058-023-00329-7.html
   My bibliography  Save this article

The fractional Boston random assignment rule and its axiomatic characterization

Author

Listed:
  • Yajing Chen

    (East China University of Science and Technology)

  • Patrick Harless

    (University of Arizona)

  • Zhenhua Jiao

    (Shanghai University of International Business and Economics)

Abstract

This study considers the problem of random assignment of a set of objects to a set of agents based on strict ordinal preferences of the agents. We analyze the fractional Boston rule, which is a generalization of the classical Boston rule to random assignment environments. We introduce two new axioms—stochastic dominance (sd)-rank-efficiency and equal-rank envy-freeness—which are respectively efficiency and fairness conditions that respect preference ranks. Sd-rank-efficiency implies ordinal efficiency, which is an efficiency concept defined by Bogomolnaia and Moulin (J Econ Theory 100(2):295–328, 2001) for random assignment environments in the sense of first-order stochastic dominance. Equal-rank envy-freeness implies equal treatment of equals. Sd-rank-efficiency and equal-rank envy-freeness characterize the fractional Boston rule.

Suggested Citation

  • 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.
    • Handle: RePEc:spr:reecde:v:28:y:2024:i:1:d:10.1007_s10058-023-00329-7
    DOI: 10.1007/s10058-023-00329-7
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10058-023-00329-7
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10058-023-00329-7?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Bogomolnaia, Anna, 2015. "Random assignment: Redefining the serial rule," Journal of Economic Theory, Elsevier, vol. 158(PA), pages 308-318.
    2. Chambers, Christopher P., 2004. "Consistency in the probabilistic assignment model," Journal of Mathematical Economics, Elsevier, vol. 40(8), pages 953-962, December.
    3. 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.
    4. Zhang, Jun, 2019. "Efficient and fair assignment mechanisms are strongly group manipulable," Journal of Economic Theory, Elsevier, vol. 180(C), pages 167-177.
    5. Ramezanian, Rasoul & Feizi, Mehdi, 2021. "Stepwise ordinal efficiency for the random assignment problem," Journal of Mathematical Economics, Elsevier, vol. 92(C), pages 60-65.
    6. Marek Pycia & Peter Troyan, 2023. "A Theory of Simplicity in Games and Mechanism Design," Econometrica, Econometric Society, vol. 91(4), pages 1495-1526, July.
    7. Kesten, Onur & Unver, Utku, 2015. "A theory of school choice lotteries," Theoretical Economics, Econometric Society, vol. 10(2), May.
    8. Nesterov, Alexander S., 2017. "Fairness and efficiency in strategy-proof object allocation mechanisms," Journal of Economic Theory, Elsevier, vol. 170(C), pages 145-168.
    9. 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.
    10. Shapley, Lloyd & Scarf, Herbert, 1974. "On cores and indivisibility," Journal of Mathematical Economics, Elsevier, vol. 1(1), pages 23-37, March.
    11. 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.
    12. ,, 2009. "Asymptotic ordinal inefficiency of random serial dictatorship," Theoretical Economics, Econometric Society, vol. 4(2), June.
    13. Nikzad, Afshin, 2022. "Rank-optimal assignments in uniform markets," Theoretical Economics, Econometric Society, vol. 17(1), January.
    14. 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.
    15. Bade, Sophie, 2016. "Fairness and group-strategyproofness clash in assignment problems," Journal of Economic Theory, Elsevier, vol. 165(C), pages 257-262.
    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. Shende, Priyanka & Purohit, Manish, 2023. "Strategy-proof and envy-free mechanisms for house allocation," Journal of Economic Theory, Elsevier, vol. 213(C).
    2. 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.
    3. Basteck, Christian & Ehlers, Lars, 2023. "Strategy-proof and envy-free random assignment," Journal of Economic Theory, Elsevier, vol. 209(C).
    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. Yajing Chen & Patrick Harless & Zhenhua Jiao, 2021. "The probabilistic rank random assignment rule and its axiomatic characterization," Papers 2104.09165, arXiv.org.
    6. Ramezanian, Rasoul & Feizi, Mehdi, 2022. "Robust ex-post Pareto efficiency and fairness in random assignments: Two impossibility results," Games and Economic Behavior, Elsevier, vol. 135(C), pages 356-367.
    7. Han, Xiang, 2024. "On the efficiency and fairness of deferred acceptance with single tie-breaking," Journal of Economic Theory, Elsevier, vol. 218(C).
    8. Ortega, Josué & Klein, Thilo, 2022. "Improving Efficiency and Equality in School Choice," QBS Working Paper Series 2022/02, Queen's University Belfast, Queen's Business School.
    9. Hougaard, Jens Leth & Moreno-Ternero, Juan D. & Østerdal, Lars Peter, 2014. "Assigning agents to a line," Games and Economic Behavior, Elsevier, vol. 87(C), pages 539-553.
    10. 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.
    11. Basteck, Christian & Ehlers, Lars H., 2022. "Strategy-proof and envy-free random assignment," Discussion Papers, Research Unit: Market Behavior SP II 2022-208, WZB Berlin Social Science Center.
    12. Priyanka Shende & Manish Purohit, 2020. "Strategy-proof and Envy-free Mechanisms for House Allocation," Papers 2010.16384, arXiv.org.
    13. Zhang, Jun, 2020. "When are efficient and fair assignment mechanisms group strategy-proof?," Games and Economic Behavior, Elsevier, vol. 119(C), pages 251-266.
    14. Basteck, Christian & Ehlers, Lars H., 2023. "On the constrained efficiency of strategy-proof random assignment," Discussion Papers, Research Unit: Market Behavior SP II 2023-202, WZB Berlin Social Science Center.
    15. Anna Bogomolnaia, 2024. "On slots’ scheduling," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 77(3), pages 653-674, May.
    16. Balbuzanov, Ivan, 2022. "Constrained random matching," Journal of Economic Theory, Elsevier, vol. 203(C).
    17. 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.
    18. Bogomolnaia, Anna & Moulin, Herve, 2015. "Size versus fairness in the assignment problem," Games and Economic Behavior, Elsevier, vol. 90(C), pages 119-127.
    19. 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.
    20. Ping Zhan, 2023. "A Simple Characterization of Assignment Mechanisms on Set Constraints," SN Operations Research Forum, Springer, vol. 4(2), pages 1-15, June.

    More about this item

    Keywords

    Random assignment; Fractional Boston rule; Sd-rank-efficiency; Equal-rank envy-freeness; Axiomatic characterization;
    All these keywords.

    JEL classification:

    • C70 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - General
    • C78 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Bargaining Theory; Matching Theory
    • D71 - Microeconomics - - Analysis of Collective Decision-Making - - - Social Choice; Clubs; Committees; Associations
    • D78 - Microeconomics - - Analysis of Collective Decision-Making - - - Positive Analysis of Policy Formulation and Implementation

    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:spr:reecde:v:28:y:2024:i:1:d:10.1007_s10058-023-00329-7. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.