Distribute Nash Equilibrium Seeking for Networked Agent Games with Time-Varying Communication Constraints

In this paper, we explore the challenge of seeking the Nash equilibrium(NE) in time-varying agent networks. Considering the impact of dynamic communication network with Denial-of-Service (DoS) attacks, we propose a distributed control strategy that ensures agents convergence to the NE despite intermittent communication disruptions caused by DoS attacks. The method utilizes a virtual observer to represent the dynamics of the real agents and applies a gradient-based update rule to guide the system towards equilibrium. The theoretical analysis shows that under weight-balanced and strongly connected communication topologies, the system can still exponentially converge to the equilibrium point as long as the duration of the DoS attack satisfies a certain proportion condition. Numerical simulation involving a multi-agent system (MAS) confirm the proposed method's effectiveness, demonstrating that the agents' states reach the NE even in the presence of communication disruptions.

Authors

Institutions

Publication Details

Published
2025-07-04
DOI
https://doi.org/10.1109/fasta65681.2025.11138931
Primary Topic
Distributed Control Multi-Agent Systems
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Distribute Nash Equilibrium Seeking for Networked Agent Games with Time-Varying Communication Constraints

Xin Wang, Tingting Yu, Shasha Xiao, Fanyong Zeng
Distributed Control Multi-Agent Systems
article

Distribute Nash Equilibrium Seeking for Networked Agent Games with Time-Varying Communication Constraints

Xin Wang, Tingting Yu, Shasha Xiao, Fanyong Zeng
article en

Abstract

In this paper, we explore the challenge of seeking the Nash equilibrium(NE) in time-varying agent networks. Considering the impact of dynamic communication network with Denial-of-Service (DoS) attacks, we propose a distributed control strategy that ensures agents convergence to the NE despite intermittent communication disruptions caused by DoS attacks. The method utilizes a virtual observer to represent the dynamics of the real agents and applies a gradient-based update rule to guide the system towards equilibrium. The theoretical analysis shows that under weight-balanced and strongly connected communication topologies, the system can still exponentially converge to the equilibrium point as long as the duration of the DoS attack satisfies a certain proportion condition. Numerical simulation involving a multi-agent system (MAS) confirm the proposed method's effectiveness, demonstrating that the agents' states reach the NE even in the presence of communication disruptions.

Heilongjiang University (CN)
Openalex Percentile: Top 72%
Distributed Control Multi-Agent Systems
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Distribute Nash Equilibrium Seeking for Networked Agent Games with Time-Varying Communication Constraints — Xin Wang, Tingting Yu, et al. · (2025) | TGRS Research Map | TGRS