{'fraction_non_alphanumeric': 0.01206140350877193, 'fraction_numerical': 0.008771929824561403, 'mean_word_length': 5.969465648854962, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Combinatorial approach to inference in partially identified incomplete structural models

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 exponentially with the number of discrete outcomes. We propose an equivalent characterization based on classical combinatorial optimization methods that allows the construction of confidence regions with an efficient bootstrap procedure that runs in linear computing time. The method can 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.