In this paper, we argue that models coming from a variety of fields share a common structure that we call matching function equilibria. This structure revolves around an aggregate matching function and a system of nonlinear equations. This encompasses search and matching models, matching models...

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 investigate a model of one-to-one matching with transferable utility when some of the characteristics of the players are unobservable to the analyst. We allow for a wide class of distributions of unobserved heterogeneity, subject only to a separability assumption that generalizes Choo and...