CIRJE-F-837 "Combinatorial Bootstrap Inference in Partially Identified Incomplete Structural Models"
Author Name Henry, Marc, Romuald Méango and Maurice Queyranne
Date January 2012
Full Paper   PDF file
Remarks  Submitted for publication.
Abstract
  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 discrete outcomes. We propose an equivalent characterization based on classical combinatorial optimization methods that alleviates this computational burden and allows the construction of confidence regions with an effcient combinatorial bootstrap procedure that runs in linear computing time. The method can also be applied to the empirical analysis of cooperative and noncooperative games, instrumental variable models of discrete choice and revealed preference analysis. We propose an application to the determinants of long term elderly care choices.