{'fraction_non_alphanumeric': 0.009592326139088728, 'fraction_numerical': 0.0, 'mean_word_length': 5.53125, '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}}
Stable Networks and Convex Payoffs

Recently a variety of link-based stability concepts have emerged in the literature on game theoretic models of social network formation. We investigate two basic formation properties that establish equivalence between some well known types of stable networks and their natural extensions. These properties can be identified as convexity conditions on the network payoff structures.