IDEAS home Printed from https://ideas.repec.org/a/eee/gamebe/v135y2022icp356-367.html
   My bibliography  Save this article

Robust ex-post Pareto efficiency and fairness in random assignments: Two impossibility results

Author

Listed:
  • Ramezanian, Rasoul
  • Feizi, Mehdi

Abstract

A random assignment is robust ex-post Pareto efficient whenever for any of its lottery decomposition, each deterministic assignment in its support is Pareto efficient. We show that ordinal efficiency implies robust ex-post Pareto efficiency while the reverse does not hold. We know that strategy-proof and ordinal efficient mechanisms satisfy neither equal treatment of equals nor equal division lower bound. We prove that it is not possible to avoid these two impossibilities by weakening ordinal efficiency to robust ex-post Pareto efficiency.

Suggested Citation

  • 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.
    • Handle: RePEc:eee:gamebe:v:135:y:2022:i:c:p:356-367
    DOI: 10.1016/j.geb.2022.06.010
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0899825622001099
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.geb.2022.06.010?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. Zhang, Jun, 2020. "When are efficient and fair assignment mechanisms group strategy-proof?," Games and Economic Behavior, Elsevier, vol. 119(C), pages 251-266.
    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. Youngsub Chun & Kiyong Yun, 2020. "Upper-contour strategy-proofness in the probabilistic assignment problem," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 54(4), pages 667-687, April.
    4. Zhou, Lin, 1990. "On a conjecture by gale about one-sided matching problems," Journal of Economic Theory, Elsevier, vol. 52(1), pages 123-135, October.
    5. Alva, Samson & Manjunath, Vikram, 2020. "The impossibility of strategy-proof, Pareto efficient, and individually rational rules for fractional matching," Games and Economic Behavior, Elsevier, vol. 119(C), pages 15-29.
    6. 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.
    7. Mohammad Akbarpour & Afshin Nikzad, 2020. "Approximate Random Allocation Mechanisms," The Review of Economic Studies, Review of Economic Studies Ltd, vol. 87(6), pages 2473-2510.
    8. Zhang, Jun, 2019. "Efficient and fair assignment mechanisms are strongly group manipulable," Journal of Economic Theory, Elsevier, vol. 180(C), pages 167-177.
    9. Erdil, Aytek, 2014. "Strategy-proof stochastic assignment," Journal of Economic Theory, Elsevier, vol. 151(C), pages 146-162.
    10. Mennle, Timo & Seuken, Sven, 2021. "Partial strategyproofness: Relaxing strategyproofness for the random assignment problem," Journal of Economic Theory, Elsevier, vol. 191(C).
    11. Nesterov, Alexander S., 2017. "Fairness and efficiency in strategy-proof object allocation mechanisms," Journal of Economic Theory, Elsevier, vol. 170(C), pages 145-168.
    12. 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.
    13. Martini, Giorgio, 2016. "Strategy-proof and fair assignment is wasteful," Games and Economic Behavior, Elsevier, vol. 98(C), pages 172-179.
    14. 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)

    Citations

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


    Cited by:

    1. Feizi, Mehdi & Ramezanian, Rasoul, 2023. "A new impossibility result for random assignments," Journal of Mathematical Economics, Elsevier, vol. 107(C).
    2. Jun Zhang, 2023. "On wastefulness of random assignments in discrete allocation problems," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 76(1), pages 289-310, July.
    3. Demeulemeester, Tom & Goossens, Dries & Hermans, Ben & Leus, Roel, 2023. "A pessimist’s approach to one-sided matching," European Journal of Operational Research, Elsevier, vol. 305(3), pages 1087-1099.

    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. Feizi, Mehdi & Ramezanian, Rasoul, 2023. "A new impossibility result for random assignments," Journal of Mathematical Economics, Elsevier, vol. 107(C).
    2. Basteck, Christian & Ehlers, Lars, 2023. "Strategy-proof and envy-free random assignment," Journal of Economic Theory, Elsevier, vol. 209(C).
    3. Zhang, Jun, 2023. "Strategy-proof allocation with outside option," Games and Economic Behavior, Elsevier, vol. 137(C), pages 50-67.
    4. Zhang, Jun, 2020. "When are efficient and fair assignment mechanisms group strategy-proof?," Games and Economic Behavior, Elsevier, vol. 119(C), pages 251-266.
    5. Demeulemeester, Tom & Goossens, Dries & Hermans, Ben & Leus, Roel, 2023. "A pessimist’s approach to one-sided matching," European Journal of Operational Research, Elsevier, vol. 305(3), pages 1087-1099.
    6. 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.
    7. Mennle, Timo & Seuken, Sven, 2021. "Partial strategyproofness: Relaxing strategyproofness for the random assignment problem," Journal of Economic Theory, Elsevier, vol. 191(C).
    8. 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.
    9. Basteck, Christian & Ehlers, Lars, 2021. "Strategy-Proof and Envy-Free Random Assignment," Rationality and Competition Discussion Paper Series 307, CRC TRR 190 Rationality and Competition.
    10. Zhang, Jun, 2019. "Efficient and fair assignment mechanisms are strongly group manipulable," Journal of Economic Theory, Elsevier, vol. 180(C), pages 167-177.
    11. Jun Zhang, 2023. "On wastefulness of random assignments in discrete allocation problems," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 76(1), pages 289-310, July.
    12. Mehdi Feizi, 2023. "The object allocation problem with favoring upper ranks," International Journal of Economic Theory, The International Society for Economic Theory, vol. 19(2), pages 370-383, June.
    13. Hashimoto, Tadashi, 2018. "The generalized random priority mechanism with budgets," Journal of Economic Theory, Elsevier, vol. 177(C), pages 708-733.
    14. Balbuzanov, Ivan, 2022. "Constrained random matching," Journal of Economic Theory, Elsevier, vol. 203(C).
    15. Bogomolnaia, Anna & Moulin, Herve, 2015. "Size versus fairness in the assignment problem," Games and Economic Behavior, Elsevier, vol. 90(C), pages 119-127.
    16. Huang, Chao & Tian, Guoqiang, 2017. "Guaranteed size ratio of ordinally efficient and envy-free mechanisms in the assignment problem," Games and Economic Behavior, Elsevier, vol. 105(C), pages 1-8.
    17. Georgios Gerasimou, 2019. "Simple Preference Intensity Comparisons," Discussion Paper Series, School of Economics and Finance 201905, School of Economics and Finance, University of St Andrews, revised 27 Apr 2020.
    18. Noda, Shunya, 2020. "Size versus truncation robustness in the assignment problem," Journal of Mathematical Economics, Elsevier, vol. 87(C), pages 1-5.
    19. Nesterov, Alexander S., 2017. "Fairness and efficiency in strategy-proof object allocation mechanisms," Journal of Economic Theory, Elsevier, vol. 170(C), pages 145-168.
    20. Afacan, Mustafa Oǧuz, 2018. "The object allocation problem with random priorities," Games and Economic Behavior, Elsevier, vol. 110(C), pages 71-89.

    More about this item

    Keywords

    Random assignment problem; Robust ex-post Pareto efficiency; Equal treatment of equals; Equal division lower bound;
    All these keywords.

    JEL classification:

    • D61 - Microeconomics - - Welfare Economics - - - Allocative Efficiency; Cost-Benefit Analysis
    • D63 - Microeconomics - - Welfare Economics - - - Equity, Justice, Inequality, and Other Normative Criteria and Measurement
    • D82 - Microeconomics - - Information, Knowledge, and Uncertainty - - - Asymmetric and Private Information; Mechanism Design

    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:eee:gamebe:v:135:y:2022:i:c:p:356-367. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/inca/622836 .

    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.