Title : ( Stepwise ordinal efficiency for the random assignment problem )
Authors: Rasoul Ramezanian , Mehdi Feizi ,
دانلود فایل برای اعضای دانشگاهAccess to full-text not allowed by authors
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 e¢ ciency, 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.
@article{paperid:1082083,
author = {Ramezanian, Rasoul and Feizi, Mehdi},
title = {Stepwise ordinal efficiency for the random assignment problem},
journal = {Journal of Mathematical Economics},
year = {2020},
volume = {92},
month = {October},
issn = {0304-4068},
pages = {60--65},
numpages = {5},
keywords = {Random Assignment Problem; Stepwise Ordinal Efficiency; Interim
Favoring Ranks; Ordinal Efficiency; Rank Efficiency; Eating Algorithm.},
}
%0 Journal Article
%T Stepwise ordinal efficiency for the random assignment problem
%A Ramezanian, Rasoul
%A Feizi, Mehdi
%J Journal of Mathematical Economics
%@ 0304-4068
%D 2020
