One-to-One Matching with Interdependent Preferences

In this paper, we introduce interdependent preferences to a classical one-to-one matching problem that allows for the prospect of being single, and study the existence and properties of stable matchings. We obtain the relationship between the stable set, the core, and the Pareto set, and give a sufficiency result for the existence of the stable set and the core. We also present several findings on the issues of gender optimality, lattices, strategy-proofness, and rationalizability.