Most priority-based assignment problems are solved using the deferred acceptance algorithm. Kojima (2010) shows that stability and nonbossiness are incompatible. We show that the deferred acceptance algorithm satisfies a weaker notion of nonbossiness for every substitutable priority structure....

We examine all dominant strategies for the deferred acceptance algorithm. Under substitutable and quota-filling choice functions, we show how untruthful dominant strategies look like. Our finding leads to the uniqueness of equilibrium outcome despite the possibility of multiple equilibria.

Public school systems generally use one of the three competing mechanisms – the Boston mechanism, the deferred acceptance mechanism and the top trading cycle mechanism – for assigning students to specific schools. Although the literature generally claims that the Boston mechanism is Pareto...