menu_book Explore the article's raw data

Communication-efficient distributed Nash equilibrium seeking under switching topologies: A decentralized gradient-based event-triggered scheme☆

Abstract

This paper is concerned with communication-efficient distributed Nash equilibrium seeking in networked games with directed and switching communication topologies. First, a decentralized gradient dynamic event-triggered scheme, which only depends on its own information of each player, is proposed to realize the efficient utilization of communication resources. Then, a distributed eventtriggered Nash equilibrium seeking strategy incorporating a switching-based compensation communication mechanism is designed, where information sampling and transmission among neighborhood players only occur at triggered time instants. Moreover, some sufficient conditions for achieving the Nash equilibrium seeking exponentially are derived, where the effects of switching communication topologies on the convergence of the developed strategies can be characterized. Finally, a simulation case study is conducted to show the effectiveness of our proposed method. (c) 2024 Elsevier Ltd. All rights are reserved, including those for text and data mining, AI training, and similar technologies.

article Article
date_range 2024
language English
link Link of the paper
format_quote
Sorry! There is no raw data available for this article.
Loading references...
Loading citations...
Featured Keywords

Distributed Nash equilibrium seeking
Event -triggered communication
Switching topologies
Consensus
Citations by Year

Share Your Research Data, Enhance Academic Impact