{'fraction_non_alphanumeric': 0.02952029520295203, 'fraction_numerical': 0.005535055350553505, 'mean_word_length': 5.7875, '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}}
GAME THEORY AND INTERFERENCE AVOIDANCE IN DECENTRALIZED NETWORKS

In networks with transmitting users having separate uncoordinated receivers, waveform adaptation by greedy interference avoidance (IA) algorithms ([1], [2] and [3]) might not lead to fair network resource allocations. A game theoretic framework for this scenario, based on Potential game theory is presented in this paper. This model provides insight into development of algorithms that are fairer than the greedy IA algorithms and are amenable to distributed implementations.