{'fraction_non_alphanumeric': 0.02, 'fraction_numerical': 0.0, 'mean_word_length': 5.333333333333333, '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}}
Fair and Robust Power Allocation Rules for Multiple Access Channels

We introduce some game theoretic notions of fairness and robustness in determining power allocations for the multiple access channel. We describe a procedure, the wireless fair-share protocol (WFS) which satisfies a strong fairness requirement and in the case where devices have “elastic demands” leads to games with unique and non-manipulable Nash equilibria. When there are multiple channels, the Nash equilibrium are also efficient in the allocation of power among the channels.