{'fraction_non_alphanumeric': 0.021897810218978103, 'fraction_numerical': 0.0, 'mean_word_length': 5.351851851851852, '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}}
Multi-user Power Allocation for Multi-service Transmission in Cooperative Communication Networks Based on Stackelberg Game

In this paper the game-theoretical is introduced into the multi-user power allocation in cooperative communication networks. We firstly divide the users into two groups that are users of real-time service and non-real-time service. We analyze the optimal power allocation for multi-service transmission; demonstrate the relationship between the two types of services. Then a bilevel programming model based on Stackelberg game is designed and a chaotic optimization algorithm is given. Finally, we present the simulation results of the optimal power allocation.