The problem of demand inversion -- a crucial step in the estimation of randomutility discrete-choice models -- is equivalent to the determination of stable outcomes intwo-sided matching models. This equivalence applies to random utility models that are notnecessarily additive, smooth, nor even...

In this paper we propose a methodology for estimating preference parameters in matching models. Our estimator applies to repeated observations of matchings among a fixed group of individuals, which is a similar data structure as in Fox (2010). Our estimator is based on stability conditions in...

We develop the theory of stability for aggregate matchings used in empirical studies and establish fundamental properties of stable matchings including the result that the set of stable matchings is a non-empty, complete, and distributive lattice. Aggregate matchings are relevant as matching...

We investigate the testable implications of the theory of stable matchings. We provide a characterization of the data that are rationalizable as a stable matching when agents' preferences are unobserved. The characterization is a simple nonparametric test for stability, in the tradition of...