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 Siow (2006). We first show that the stable matching maximizes a social gain function that trades off the average surplus due to the observable characteristics and a generalized entropy term that reflects the impact of matching on unobserved characteristics. We use this result to derive simple closed-form formulæ that identify the joint surplus in every possible match and the equilibrium utilities of all participants, given any known distribution of unob...
This paper considers equilibrium two-sided search with ex ante heterogeneous agents, vectors of attr...
In October 2012 the Nobel prize was attributed to Al Roth and Lloyd Shapley for their work on matchi...
Economists wish to use data on matches to learn about the structural primitives that govern sort-ing...
We investigate a matching game with transferable utility when some of the characteristics of the pla...
We investigate in this paper the theory and econometrics of optimal matchings with competing criteri...
We review recent advances in the estimation of matching models under transferable utility, with spec...
We study partial identification of the preference parameters in the one-to-one matching model with p...
We introduce an empirical framework for models of matching with imperfectly transferable utility and...
This paper provides closed-form formulas for a multidimensional two-sided matching problem with tran...
Imposing a separability assumption on the joint surplus in transferable utility matching models has ...
Agents in two-sided matching games vary in characteristics that are unobservable in typical data on ...
This paper provides a unifying framework of one-to-one and many-to-one matching without transfers an...
In this paper we propose two simple methods to estimate models of matching with transferable and sep...
We investigate in this paper the theory and econometrics of optimal matchings with competing criteri...
In this paper, we argue that models coming from a variety of fields share a common structure that we...
This paper considers equilibrium two-sided search with ex ante heterogeneous agents, vectors of attr...
In October 2012 the Nobel prize was attributed to Al Roth and Lloyd Shapley for their work on matchi...
Economists wish to use data on matches to learn about the structural primitives that govern sort-ing...
We investigate a matching game with transferable utility when some of the characteristics of the pla...
We investigate in this paper the theory and econometrics of optimal matchings with competing criteri...
We review recent advances in the estimation of matching models under transferable utility, with spec...
We study partial identification of the preference parameters in the one-to-one matching model with p...
We introduce an empirical framework for models of matching with imperfectly transferable utility and...
This paper provides closed-form formulas for a multidimensional two-sided matching problem with tran...
Imposing a separability assumption on the joint surplus in transferable utility matching models has ...
Agents in two-sided matching games vary in characteristics that are unobservable in typical data on ...
This paper provides a unifying framework of one-to-one and many-to-one matching without transfers an...
In this paper we propose two simple methods to estimate models of matching with transferable and sep...
We investigate in this paper the theory and econometrics of optimal matchings with competing criteri...
In this paper, we argue that models coming from a variety of fields share a common structure that we...
This paper considers equilibrium two-sided search with ex ante heterogeneous agents, vectors of attr...
In October 2012 the Nobel prize was attributed to Al Roth and Lloyd Shapley for their work on matchi...
Economists wish to use data on matches to learn about the structural primitives that govern sort-ing...