Estimating Separable Matching Models

Published on ● Video Link: https://www.youtube.com/watch?v=a0fcV2w8-H8



Duration: 26:33
152 views
2


Bernard Salanié (Columbia University)
https://simons.berkeley.edu/talks/bernard-salanie-columbia-university-2023-10-26
Online and Matching-Based Market Design

Most recent empirical applications of matching with transferable utility have imposed a natural restriction: that the joint surplus be separable in the sources of unobserved heterogeneity. We propose here two simple methods to estimate models in this class. The first method is a minimum distance estimator that relies on the generalized entropy of matching introduced in Galichon and Salanie (2022). The second applies to the more special but popular Choo and Siow (2006) model, which it reformulates as a generalized linear model with two-way fixed effects. Both methods are easy to apply and perform very well.







Tags:
Simons Institute
theoretical computer science
UC Berkeley
Computer Science
Theory of Computation
Theory of Computing
Online and Matching-Based Market Design
Bernard Salanié