Photo from archive.org
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… Click to show full abstract
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:
ordinal efficiency;
efficiency random;
assignment problem;
efficiency;
stepwise ordinal;
random assignment
Journal Title: Journal of Mathematical Economics
Year Published: 2020
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!
Journal Title: Journal of Mathematical Economics
Year Published: 2020
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!