Prescribed-Time Fully Distributed Nash Equilibrium Seeking Strategy in Networked Games

作     者：Cheng Qian Lei Ding Cheng Qian;Lei Ding

作者机构：the Institute of Advanced Technology for Carbon NeutralityCollege of Automation&the College of Artificial Intelligence Nanjing University of Posts and TelecommunicationsNanjing 210023China IEEE 

出 版 物：《IEEE/CAA Journal of Automatica Sinica》 (自动化学报（英文版）)

年 卷 期：2024年第11卷第1期

页      面：261-263页

核心收录：

学科分类：12[管理学] 1201[管理学-管理科学与工程(可授管理学、工学学位)] 07[理学] 070104[理学-应用数学] 070105[理学-运筹学与控制论] 0701[理学-数学] 

基　　金：supported by the National Natural Science Foundation of China (NSFC) (62073171) the Natural Science Foundation of Jiangsu Province (BK20200744) 

主　　题：parameters seeking prescribed 

摘      要：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.