We study the allocation of indivisible objects under the general endowment structures proposed by Pápai (2000) – the consistent inheritance structures – which specify the initial endowment of objects and also the inheritance of remaining objects after subsets of agents are matched and...

We revisit the school choice problem with consent proposed by Kesten (2010), which seeks to improve the efficiency of the student-optimal deferred acceptance algorithm (DA) by obtaining students' consent to give up their priorities. We observe that for students to consent, we should use their...

For school choice (priority-based allocation) problems, when the priority structure is acyclic, the associated student-proposing deferred acceptance algorithm is Pareto efficient and group strategy-proof (Ergin, 2002). We reveal a hidden iterative removal structure behind such deferred...

This paper investigates the discrepancy among the multiple ranking lists of the same performers. It treats ranking lists as some well-positioned information products rather than the repetitive measures of performance. Hence, discrepancy stems from the differentiation rather than the measure...