 One-sided matchings: house allocation problems in the Cornell networks and markets text

Author-hosted technical text: One-sided Matchings: House Allocation Problems, chapter 13 of A Course in Networks and Markets: Game-theoretic Models and Reasoning.

Relevant locator: §13.2, Definition 13.1 and Theorem 13.2, Pareto efficiency of serial dictatorship with strict preferences. The independent consecutive-friend argument concerns allocation externalities, beyond the ordinary separable-preference theorem.