On the efficiency and fairness of deferred acceptance with single tie-breaking

Abstract

As a random allocation rule for indivisible object allocation under weak priorities, deferred acceptance with single tie-breaking (DA-STB) is not ex-post constrained efficient. We first observe that it also fails to satisfy equal-top fairness, which requires that two agents be assigned their common top choice with equal probability if they have equal priority for it. Then, it is shown that DA-STB is ex-post constrained efficient, if and only if it is equal-top fair, if and only if the priority structure satisfies a certain acyclic condition. We further characterize the priority structures under which DA-STB is ex-post stable-and-efficient. Based on the characterized priority domains, and using a weak fairness notion called local envy-freeness, new theoretical support is provided for the use of this rule: for any priority structure, among the class of strategy-proof, ex-post stable, symmetric, and locally envy-free rules, each of the above desiderata—ex-post constrained efficiency, ex-post stability-and-efficiency, and equal-top fairness—can be achieved if and only if it can be achieved by DA-STB.