We reexamine the existence of stable solutions in a class of three-sided matching problems previously studied by Zhang and Zhong (2021). The sets of participants are U, V, and W. Agents in U have strict preferences defined on V, agents in V have strict preferences defined on W, and agents in W...

In classical school choice contexts there exists a centralized assignment procedure that is stable and strategy-proof: the Gale-Shapley student-optimal stable mechanism. We show that this property is not satisfied when externalities are incorporated into the model, even in scenarios in which...

In a class of three-sided matching problems in which the core is non-empty, we show that no stable mechanism is strategy-proof for those who internalize the trilateral structure of the market in their preferences. This impossibility is related to the incompatibility between stability, one-sided...