We propose a computationally feasible inference method in finite games of complete information. Galichon and Henry, 2011 and Beresteanu, Molchanov, and Molinari, 2011 show that the empirical content in such models is characterized by a collection of moment inequalities whose number increases...

We propose a computationally feasible inference method infinite games of complete information. Galichon and Henry (2011) and Beresteanu, Molchanov, and Molinari (2011) show that such models are equivalent to a collection of moment inequalities that increases exponentially with the number of...

We analyze the empirical content of the Roy model, stripped down to its essential features, namely sector specific unobserved heterogeneity and self-selection on the basis of potential outcomes. We characterize sharp bounds on the joint distribution of potential outcomes and testable...

We propose a computationally feasible inference method in finite games of complete information. Galichon and Henry (2011) and Beresteanu, Molchanov, and Molinari (2011) show that the empirical content in such models is characterized by a collection of moment inequalities whose number increases...