Rastgele öncelik kuralının ordinal verimliliği

The random assignment problem is the task of assigning a number of objects to an equal number of agents. A common solution to this is the Random Priority Rule which is strategy-proof, ex-post efficient and treats equals equally. However, the Random Priority Rule is not guaranteed to be ordinally efficient when there are more than three agents. I provide necessary and sufficient conditions for ordinal efficiency for the Random Priority Rule by characterizing ordinal efficiency in random assignment problems with few objects. The results are generalized by provided methods to obtain smaller problems from any random assignment problem while preserving ordinal efficiency under the Random Priority Rule, and where the methods do not yield small enough problems I provide an algorithm that characterizes ordinal efficiency.