{'fraction_non_alphanumeric': 0.011049723756906077, 'fraction_numerical': 0.0055248618784530384, 'mean_word_length': 5.25, '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}}
Assortative matching with network spillovers

This paper investigates endogenous network formation by heterogeneous agents. The agents' types determine the value of linking and we incorporate spillovers as utility from indirect connections. We provide sufficient conditions for a class of networks with sorting to be stable for low to moderate spillovers; with only two types these networks are the unique pairwise stable ones. We also show that this sorting is suboptimal for moderate to high spillovers despite otherwise obeying the conditions for sorting in Becker 1973. This shows that in our sorted networks a tension between stability and efficiency is present. We analyze a policy tool to mitigate suboptimal sorting.