Reclaim-proof allocation of indivisible objects

Abstract

We study desirability axioms imposed on allocations in indivisible object allocation problems. The existing axioms in the literature are various conditions of robustness to blocking coalitions with respect to agentsʼ ex ante (individual rationality and group rationality) and ex post (Pareto efficiency) endowments. We introduce a stringent axiom that encompasses and strengthens the existing ones. An allocation is reclaim-proof if it is robust to blocking coalitions with respect to any conceivable interim endowments of agents. This is an appealing property in dynamic settings, where the assignments prescribed by an allocation to be implemented need to be made in multiple rounds rather than all in one shot. We show that an allocation is reclaim-proof if and only if it is induced by a YRMH–IGYT mechanism (introduced by Abdulkadiroğlu and Sönmez, 1999) and if and only if it is a competitive allocation.