I explore the estimation of transferable utility matching games, encompassing many-to-many matching, marriage and matching with trading networks (trades). I introduce a matching maximum score estimator that does not suffer from a computational curse of dimensionality in the number of agents in a...

We study nonparametric identification of single-agent discrete choice models for bundles (without requiring bundle-specific prices) and of binary games of complete information. We show that these two models are quite similar from an identification standpoint. Moreover, they are mathematically...

I explore the estimation of transferable utility matching games, encompassing many-to-many matching, marriage, and matching with trading networks (trades). Computational issues are paramount. I introduce a matching maximum score estimator that does not suffer from a computational curse of...

We study nonparametric identification of single-agent discrete choice models for bundles and binary games of complete information. We provide conditions under which we can recover both the interaction effects and the distributions of potentially correlated unobservables across goods in...