We show that confidence regions covering the identified set may be preferable to confidence regions covering each of its points in robust control applications.

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 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 derive the empirical content of an instrumental variables model of sectorial choice with binary outcomes. Assumptions on selection include the simple, extended and generalized Roy models. The derived bounds are nonparametric intersection bounds and are simple enough to lend themselves to...

In the spatial model of voting, voters choose the candidate closest to them in the ideological space. Recent work by (Degan and Merlo 2009) shows that it is falsifiable on the basis of individual voting data in multiple elections. We show how to tackle the fact that the model only partially...

We derive the empirical content of Nash equilibrium in 2×2 games of perfect information, including duopoly entry and coordination games. The derived bounds are nonparametric intersection bounds and are simple enough to lend themselves to existing inference methods. Implications of pure strategy...

We derive the empirical content of an instrumental variables model of sectoral choice with discrete outcomes. The partial identification results extend existing work on sharp bounds in binary choice threshold crossing models in allowing sector specific unobserved heterogeneity. Assumptions on...