{'fraction_non_alphanumeric': 0.012838801711840228, 'fraction_numerical': 0.0, 'mean_word_length': 5.622641509433962, '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}}
Spectrum sharing with smooth supermodular game in cognitive radio networks

In this paper, a supermodular game theoretic approach is investigated for spectrum sharing in cognitive radio networks. We consider a Bertrand competition model, in which primary service providers compete to sell their spare spectrum and then to maximize their individual profits. We demonstrate that the Bertrand competition is a smooth supermodular game, and a round-robin optimization algorithm is developed to obtain the optimal price solutions. Simulation results verify that the algorithm approximately converges to an equilibrium point, and the influence of the exogenous variable on the equilibrium point is analyzed.