Pre-specified-time Distributed Nash Equilibrium Seeking for Games

Qianle Tao, Chengxin Xian, Yu Zhao

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

This paper considers the Nash equilibrium seeking problem of the game in the multi-agent system. Different from the existing research, a new method is proposed by multi-step planning to solve the pre-specified-time game, which based on the technique of the leader-following consensus protocol and gradient play. The algorithm, which players can update their action at each sampling moment, is designed to enable each player's behavior converge to the Nash equilibrium point of the game at a specified time that can be appointed in advance. In addition, the players communicate via an undirected and connected network. Finally, the algorithm proposed in this paper is verified by numerical simulations.

Original languageEnglish
Title of host publication3rd International Conference on Industrial Artificial Intelligence, IAI 2021
PublisherInstitute of Electrical and Electronics Engineers Inc.
ISBN (Electronic)9781665435178
DOIs
StatePublished - 2021
Event3rd International Conference on Industrial Artificial Intelligence, IAI 2021 - Shenyang, China
Duration: 8 Nov 202111 Nov 2021

Publication series

Name3rd International Conference on Industrial Artificial Intelligence, IAI 2021

Conference

Conference3rd International Conference on Industrial Artificial Intelligence, IAI 2021
Country/TerritoryChina
CityShenyang
Period8/11/2111/11/21

Keywords

  • consensus tracking
  • discrete-time game
  • Nash equilibrium seeking
  • pre-specified-time control

Fingerprint

Dive into the research topics of 'Pre-specified-time Distributed Nash Equilibrium Seeking for Games'. Together they form a unique fingerprint.

Cite this