Combinatorial Bootstrap Inference IN in Prtially Identified Incomplete Structural Models
AbstractWe 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.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoPaper provided by CIRJE, Faculty of Economics, University of Tokyo in its series CIRJE F-Series with number CIRJE-F-837.
Length: 37 pages
Date of creation: Jan 2012
Date of revision:
Contact details of provider:
Postal: Hongo 7-3-1, Bunkyo-ku, Tokyo 113-0033
Web page: http://www.cirje.e.u-tokyo.ac.jp/index.html
More information through EDIRC
This paper has been announced in the following NEP Reports:
- NEP-ALL-2012-02-01 (All new papers)
- NEP-DCM-2012-02-01 (Discrete Choice Models)
- NEP-ECM-2012-02-01 (Econometrics)
You can help add them by filling out this form.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (CIRJE administrative office).
If references are entirely missing, you can add them using this form.