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

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.