{'fraction_non_alphanumeric': 0.011834319526627219, 'fraction_numerical': 0.001183431952662722, 'mean_word_length': 5.458015267175573, '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}}
Generalized Nash Equilibrium Seeking Strategy for Nonsmooth Noncooperative Game with Equality Constraints

This article discusses the problem of Nash equilibrium seeking for noncooperative game with equality constraints. In the problem, each player desires to maximize its nonsmooth payoff function which depends on both its own strategy and the strategy of other players. Besides, the game-player is subjected to private local equality constraints. We use a l1 penalty function to deal with the equality constraints and a Nash equilibrium seeking strategy is designed on the basis of differential inclusions and subgradient methods. And we show that the strategy of player is exponentially convergent to the Nash equilibrium with Lyapunov methods. Finally, a numerical example is presented to illustrate the validity of our theoretical results.