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

Ex-post favoring ranks: a fairness notion for the random assignment problem

Author

Listed:
  • Rasoul Ramezanian

    (Ferdowsi University of Mashhad)

  • Mehdi Feizi

    (Ferdowsi University of Mashhad)

Abstract

We introduce two notions of ex-post fairness, namely ex-post favoring ranks (EFR) and robust ex-post favoring ranks, which consider whether objects are received by those agents who have the highest rank for them. We examine their compatibility with standard properties of random assignments and state some impossibility theorems. We also propose and formalize a revised version of the Boston mechanism and prove that it provides an EFR random assignment.

Suggested Citation

  • Rasoul Ramezanian & Mehdi Feizi, 2021. "Ex-post favoring ranks: a fairness notion for the random assignment problem," Review of Economic Design, Springer;Society for Economic Design, vol. 25(3), pages 157-176, September.
    • Handle: RePEc:spr:reecde:v:25:y:2021:i:3:d:10.1007_s10058-021-00246-7
    DOI: 10.1007/s10058-021-00246-7
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10058-021-00246-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-021-00246-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. Fuhito Kojima & M. Ünver, 2014. "The “Boston” school-choice mechanism: an axiomatic approach," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 55(3), pages 515-544, April.
    2. Basteck, Christian, 2018. "Fair solutions to the random assignment problem," Journal of Mathematical Economics, Elsevier, vol. 79(C), pages 163-172.
    3. Nesterov, Alexander S., 2017. "Fairness and efficiency in strategy-proof object allocation mechanisms," Journal of Economic Theory, Elsevier, vol. 170(C), pages 145-168.
    4. Doğan, Battal & Klaus, Bettina, 2018. "Object allocation via immediate-acceptance: Characterizations and an affirmative action application," Journal of Mathematical Economics, Elsevier, vol. 79(C), pages 140-156.
    5. Edi Karni & Tim Salmon & Barry Sopher, 2008. "Individual sense of fairness: an experimental study," Experimental Economics, Springer;Economic Science Association, vol. 11(2), pages 174-189, June.
    6. 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.
    7. Dur, Umut Mert, 2019. "The modified Boston mechanism," Mathematical Social Sciences, Elsevier, vol. 101(C), pages 31-40.
    8. Yajing Chen, 2016. "New axioms for immediate acceptance," Review of Economic Design, Springer;Society for Economic Design, vol. 20(4), pages 329-337, December.
    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. Atila Abdulkadiroglu & Tommy Andersson, 2022. "School Choice," NBER Working Papers 29822, National Bureau of Economic Research, Inc.
    2. Shende, Priyanka & Purohit, Manish, 2023. "Strategy-proof and envy-free mechanisms for house allocation," Journal of Economic Theory, Elsevier, vol. 213(C).
    3. Ramezanian, Rasoul & Feizi, Mehdi, 2021. "Stepwise ordinal efficiency for the random assignment problem," Journal of Mathematical Economics, Elsevier, vol. 92(C), pages 60-65.
    4. 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.
    5. Mennle, Timo & Seuken, Sven, 2021. "Partial strategyproofness: Relaxing strategyproofness for the random assignment problem," Journal of Economic Theory, Elsevier, vol. 191(C).
    6. 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.
    7. Di Feng & Jacob Coreno, 2024. "Justified Fairness in House Allocation Problems: two Characterizations of Strategy-proof Mechanisms," Papers 2407.14101, arXiv.org.
    8. Basteck, Christian & Ehlers, Lars, 2023. "Strategy-proof and envy-free random assignment," Journal of Economic Theory, Elsevier, vol. 209(C).
    9. Basteck, Christian & Klaus, Bettina & Kübler, Dorothea, 2021. "How lotteries in school choice help to level the playing field," Games and Economic Behavior, Elsevier, vol. 129(C), pages 198-237.
    10. Jorge Alcalde-Unzu & Flip Klijn & Marc Vorsatz, 2023. "Constrained school choice: an experimental QRE analysis," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 61(3), pages 587-624, October.
    11. Jaramillo, Paula & Kayı, Çaǧatay & Klijn, Flip, 2021. "School choice: Nash implementation of stable matchings through rank-priority mechanisms," Journal of Mathematical Economics, Elsevier, vol. 95(C).
    12. Karakaya, Mehmet & Klaus, Bettina & Schlegel, Jan Christoph, 2019. "Top trading cycles, consistency, and acyclic priorities for house allocation with existing tenants," Journal of Economic Theory, Elsevier, vol. 184(C).
    13. 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.
    14. 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.
    15. 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.
    16. Zhang, Jun, 2019. "Efficient and fair assignment mechanisms are strongly group manipulable," Journal of Economic Theory, Elsevier, vol. 180(C), pages 167-177.
    17. Feizi, Mehdi & Ramezanian, Rasoul, 2023. "A new impossibility result for random assignments," Journal of Mathematical Economics, Elsevier, vol. 107(C).
    18. Zhang, Jun, 2023. "Strategy-proof allocation with outside option," Games and Economic Behavior, Elsevier, vol. 137(C), pages 50-67.
    19. 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.
    20. Aziz, Haris & Brandl, Florian & Brandt, Felix & Brill, Markus, 2018. "On the tradeoff between efficiency and strategyproofness," Games and Economic Behavior, Elsevier, vol. 110(C), pages 1-18.

    More about this item

    Keywords

    Random assignment problem; Favoring higher ranks; Interim favoring ranks; Ex-post favoring ranks; Robust ex-post favoring ranks;
    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:spr:reecde:v:25:y:2021:i:3:d:10.1007_s10058-021-00246-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.