We propose two Mathematical Programming with Equilibrium Constraints (MPEC) formulations: the MPEC-Sparse and the MPEC-Dense to estimate a class of separable matching models. We compare MPEC with the Nested Fixed-Point (NFXP) algorithm -- a well-received method in the literature of structural...

This paper introduces a maximum likelihood estimator of the value of job amenities and labor productivity in a single matching market based on the observation of equilibrium matches and wages. The estimation procedure simultaneously fits both the matching patterns and the wage curve. While our...

Centralized school assignment algorithms must distinguish between applicants with the same preferences and priorities. This is done with randomly assigned lottery numbers, nonlottery tie-breakers like test scores, or both. The New York City public high school match illustrates the latter, using...

A large class of two-sided matching models that include both transferable and non-transferable utility result in positive assortative matching along a latent index. Data from matching markets, however, may not exhibit perfect assortativity due to the presence of unobserved characteristics. This...

This paper derives conditions for identification of a general class of sample selection models that allows for selection based on, for example, game-theoretic models. The conditions apply to models with binary or continuous outcome variables and generalize the conditions for the standard Heckman...

In this paper, the authors develop a new estimation method that is suitable for censored models with two high-dimensional fixed effects and that is based on a sequence of least squares regressions, yielding significant savings in computing time and hence making it applicable to frameworks in...