{'fraction_non_alphanumeric': 0.017741935483870968, 'fraction_numerical': 0.0064516129032258064, 'mean_word_length': 4.594594594594595, '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}}
Profitability of a Merger on Networks

In this paper, we examine the profitability of a merger when agents interact on a network. We assume that the value function is size‐dependent, i.e. the value of a coalition does not depend on the identities of the coalition but only on each size of its components. Under the assumption that the third difference of the value function with respect to the size of each component is nonnegative, which is a weaker condition of increasing complementarity by Segal in 2003, we show that a merger of any subset of agents cannot be profitable if the underlying network is cycle‐complete.