{'fraction_non_alphanumeric': 0.018404907975460124, 'fraction_numerical': 0.0, 'mean_word_length': 4.975609756097561, '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}}
Non-Revelation Mechanisms in Many-to-One Markets

In this study we present a simple mechanism in a many-to-one matching market where multiple costless applications are allowed. The mechanism is based on the principles of eligibility and priority and it implements the set of stable matchings in Subgame Perfect Nash Equilibrium. We extend the analysis to a symmetric mechanism where colleges and students interchange their roles. This mechanism also implements the set of stable matchings.