{'fraction_non_alphanumeric': 0.016476552598225603, 'fraction_numerical': 0.0, 'mean_word_length': 5.991150442477876, '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}}
Decentralized College Admissions

We study decentralized college admissions with uncertain student preferences. Colleges strategically admit students likely to be overlooked by competitors. Highly ranked students may receive fewer admissions or have a higher chance of receiving no admissions than those ranked below. When students’ attributes are multidimensional, colleges avoid head-on competition by placing excessive weight on school-specific attributes such as essays. Restricting the number of applications or wait-listing alleviates enrollment uncertainty, but the outcomes are inefficient and unfair. A centralized matching via Gale and Shapley’s deferred acceptance algorithm attains efficiency and fairness but may make some colleges worse off than under decentralized matching.