In this paper, we study the core of two-sided, one-to-one matching problems. First, in a model in which agents have strict preferences over their potential mates and are allowed to remain single, we characterize the core as the unique solution that satisfies individual rationality, Pareto...

We establish three impossibility results for roommate problems. First, no single valued solution is Pareto optimal and anonymous. Next, no solution satisfies Pareto optimality, anonymity and converse consistency. Finally, no pseudo-refinement of the core satisfies consistency.