Dear Editor, This letter is concerned with prescribed-time fully distributed Nash equilibrium seeking for networked games under directed graphs. An adaptive algorithm is proposed to ensure the convergence of all playe...Dear Editor, This letter is concerned with prescribed-time fully distributed Nash equilibrium seeking for networked games under directed graphs. An adaptive algorithm is proposed to ensure the convergence of all players to the Nash equilibrium without requiring any knowledge of global parameters. Moreover, it is theoretically proved that the convergence time of the proposed seeking strategy can be predefined based on practical requirements. Finally, a numerical example is presented to validate the effectiveness of the proposed method.展开更多
基金supported by the National Natural Science Foundation of China (NSFC) (62073171)the Natural Science Foundation of Jiangsu Province (BK20200744)。
文摘Dear Editor, This letter is concerned with prescribed-time fully distributed Nash equilibrium seeking for networked games under directed graphs. An adaptive algorithm is proposed to ensure the convergence of all players to the Nash equilibrium without requiring any knowledge of global parameters. Moreover, it is theoretically proved that the convergence time of the proposed seeking strategy can be predefined based on practical requirements. Finally, a numerical example is presented to validate the effectiveness of the proposed method.
