Stepwise ordinal efficiency for the random assignment problem

Rasoul Ramezanian and Mehdi Feizi

Journal of Mathematical Economics, 2021, vol. 92, issue C, 60-65

Abstract: We introduce a notion of efficiency, called Stepwise Ordinal Efficiency (SOE), and prove that it coincides with a fairness notion of interim favoring ranks, in the sense of Harless (2018). We also prove that SOE implies ordinal efficiency, while it is not compatible with rank efficiency. Then, we provide an impossibility result which states that no mechanism meets SOE, weak strategy-proof, and strong equal treatment of equals. Finally, we show that a modified eating algorithm satisfies SOE.

Keywords: Random assignment problem; Stepwise ordinal efficiency; Interim favoring ranks; Ordinal efficiency; Rank efficiency; Eating algorithm (search for similar items in EconPapers)
Date: 2021
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0304406820301105
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:mateco:v:92:y:2021:i:c:p:60-65

DOI: 10.1016/j.jmateco.2020.10.005

Access Statistics for this article

Journal of Mathematical Economics is currently edited by Atsushi (A.) Kajii

More articles in Journal of Mathematical Economics from Elsevier
Bibliographic data for series maintained by Catherine Liu ().