Dear Editor,This letter examines the fixed-time stability of the Nash equilibrium(NE)in non-cooperative games.We propose a consensus-based NE seeking algorithm for situations where players do not have perfect informat...Dear Editor,This letter examines the fixed-time stability of the Nash equilibrium(NE)in non-cooperative games.We propose a consensus-based NE seeking algorithm for situations where players do not have perfect information and communicate via a topology graph.The proposed algorithm can achieve NE in a fixed time that does not depend on initial conditions and can be adjusted in advance.展开更多
基金supported by the National Natural Science Foundation of China(62373107,61921004,62303009)the Natural Science Foundation of Jiangsu Province of China(BK20202006)the“Zhishan”Scholars Programs of Southeast University。
文摘Dear Editor,This letter examines the fixed-time stability of the Nash equilibrium(NE)in non-cooperative games.We propose a consensus-based NE seeking algorithm for situations where players do not have perfect information and communicate via a topology graph.The proposed algorithm can achieve NE in a fixed time that does not depend on initial conditions and can be adjusted in advance.
