{'fraction_non_alphanumeric': 0.03143712574850299, 'fraction_numerical': 0.0029940119760479044, 'mean_word_length': 5.495145631067961, '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}}
Iterative Algorithms for Nash Equilibrium of an Extended OSNR Game

This paper addresses the problem of optical signal-to-noise ratio (OSNR) optimization problem in optical networks. Based on the extended OSNR Nash game formulation that includes power capacity constraints in [10], the Nash equilibrium (NE) solution is analytically intractable and highly nonlinear. We investigate the properties of the NE solution and based on these, we develop iterative algorithms to compute the NE solution: a parallel update algorithm (PUA) and a relaxed parallel update algorithm (r-PUA). We study their convergence with different conditions, both theoretically and numerically.