首页|Stepwise ordinal efficiency for the random assignment problem
Stepwise ordinal efficiency for the random assignment problem
扫码查看
点击上方二维码区域，可以放大扫码查看
原文链接
NSTL
Elsevier
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. (C) 2020 Elsevier B.V. All rights reserved.
Random assignment problemStepwise ordinal efficiencyInterim favoring ranksOrdinal efficiencyRank efficiencyEating algorithm
NSTL
Elsevier
