Recognizing the fact that a player’s cognition plays a defining role in the resulting equilibrium of a game of competition, this paper provides the foundation for a Nash game with forward-looking players by presentin...Recognizing the fact that a player’s cognition plays a defining role in the resulting equilibrium of a game of competition, this paper provides the foundation for a Nash game with forward-looking players by presenting a formal definition of the Nash game with consideration of the players’ belief. We use a simple two-firm model to demonstrate its fundamental difference from the standard Nash and Stackelberg games. Then we show that the players’ belief functions can be regarded as the optimization parameters for directing the game towards a much more desirable equilibrium.展开更多
In this paper, a power allocation problem based on the Cournot game and generalized Nash game is proposed. After integrating dynamic average consensus algorithm and distributed projection neural network through singul...In this paper, a power allocation problem based on the Cournot game and generalized Nash game is proposed. After integrating dynamic average consensus algorithm and distributed projection neural network through singular perturbation systems, a normalized Nash equilibrium seeking algorithm is presented to solve the proposed power allocation problem in a distributed way.Combine Lyapunov stability with the singular perturbation analysis, the convergence of the proposed algorithm is analyzed. A simulation on IEEE 118-bus confirms that the proposed distributed algorithm can adjust the power allocation according to different situations, while keeping the optimal solution within the feasible set.展开更多
文摘Recognizing the fact that a player’s cognition plays a defining role in the resulting equilibrium of a game of competition, this paper provides the foundation for a Nash game with forward-looking players by presenting a formal definition of the Nash game with consideration of the players’ belief. We use a simple two-firm model to demonstrate its fundamental difference from the standard Nash and Stackelberg games. Then we show that the players’ belief functions can be regarded as the optimization parameters for directing the game towards a much more desirable equilibrium.
基金supported by the National Natural Science Foundation of China (Grant No. 61673107)the Jiangsu Provincial Key Laboratory of Networked Collective Intelligence (Grant No. BM2017002)。
文摘In this paper, a power allocation problem based on the Cournot game and generalized Nash game is proposed. After integrating dynamic average consensus algorithm and distributed projection neural network through singular perturbation systems, a normalized Nash equilibrium seeking algorithm is presented to solve the proposed power allocation problem in a distributed way.Combine Lyapunov stability with the singular perturbation analysis, the convergence of the proposed algorithm is analyzed. A simulation on IEEE 118-bus confirms that the proposed distributed algorithm can adjust the power allocation according to different situations, while keeping the optimal solution within the feasible set.