Stable matchings may fail to exist in the roommate matching problem, both when utility is transferable and when it is not. We show that when utility is transferable, the existence of a stable matching is restored when there is an even number of individuals of indistinguishable characteristics...

We propose an alternative notion of non-transferable utility (NTU) stability in matching models that relies on money burning. Our model captures an exchange economy with indivisible goods, fixed prices, and no centralized assignment mechanism. In these models, a non-transferable numeraire (e.g.,...

Stable matchings may fail to exist in the roommate matching problem, both when utility is transferable and when it is not. We show that when utility is transferable, the existence of a stable matching is restored when there is an even number of individuals of indistinguishable characteristics...

Stable matchings may fail to exist in the roommate matching problem, both when utility is transferable and when it is not. We show that when utility is transferable, the existence of a stable matching is restored when there is an even number of individuals of indistinguishable characteristics...

We characterize solutions for two-sided matching, both in the transferable - and in the nontransferable - utility frameworks, using a cardinal formulation. Our approach makes the comparison of the matching models with and without transfers particularly transparent. We introduce the concept of a...