{'fraction_non_alphanumeric': 0.013066202090592335, 'fraction_numerical': 0.0, 'mean_word_length': 5.17741935483871, '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}}
A game theoretic distributed dynamic channel allocation scheme with transmission option

Game theory is a useful tool that can be used to study the distributed resource allocation problem, since each node in the network tries to maximize his own payoff and hence a need to resolve their conflicting interests. In this paper, we introduce utility functions so that the strategy set of each node allows no transmission. We incorporate the effect of interference a node is causing to the surroundings into its utility function so that those nodes which are not so favorable for transmission should sacrifice for the welfare of the network. Although non-cooperative game model is used, modifying the utility function in an effective way causes the overall impact to have some degree of ldquocooperationrdquo or ldquoself-awarenessrdquo among nodes. Our studies show that if utility function is properly chosen, a best-response allocation strategy does exist for each user. An algorithm which performs iterative update among nodes until Nash equilibrium convergence is proposed. Finally, we present our numerical results for our channel allocation game.