Distributed Nash equilibrium solution for multi-agent game in adversarial environment: A reinforcement learning method

This paper investigates the leader–follower optimal consensus problem for linear multi-agent systems with adversarial inputs from a differential graphical game perspective. For the multi-agent optimal control problem described by differential graphical game, it is equally significant that the control policy is distributed and adheres to Nash equilibrium solution . However, achieving both distributed control and Nash equilibrium simultaneously has proven impossible in most existing game formulations. This paper proposes a new game formulation that can overcome this limitation, enabling each agent to reach a Nash equilibrium under a distributed policy, thereby improving system performance . Furthermore, a partially model-free reinforcement learning method is employed to obtain the optimal policy when the dynamic information is partially unknown, with admissibility condition of the initial policy further relaxed. Finally, two comparative simulations are presented to demonstrate the validity and superiority of the proposed approach.

Authors

Publication Details

Journal
Automatica
Published
2025-05-15
DOI
https://doi.org/10.1016/j.automatica.2025.112342
Citations
5
Primary Topic
Adaptive Dynamic Programming Control
Type
article
Field-Weighted Citation Impact
7.52
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Distributed Nash equilibrium solution for multi-agent game in adversarial environment: A reinforcement learning method

Meng Wang, Kaitian Chen, Huaicheng Yan, Zhichen Li et al.
5 citations
Automatica
Adaptive Dynamic Programming Control
7.52
article

Distributed Nash equilibrium solution for multi-agent game in adversarial environment: A reinforcement learning method

Meng Wang, Kaitian Chen, Huaicheng Yan, Zhichen Li, Qiwei Liu
article en
5 citations

Abstract

This paper investigates the leader–follower optimal consensus problem for linear multi-agent systems with adversarial inputs from a differential graphical game perspective. For the multi-agent optimal control problem described by differential graphical game, it is equally significant that the control policy is distributed and adheres to Nash equilibrium solution . However, achieving both distributed control and Nash equilibrium simultaneously has proven impossible in most existing game formulations. This paper proposes a new game formulation that can overcome this limitation, enabling each agent to reach a Nash equilibrium under a distributed policy, thereby improving system performance . Furthermore, a partially model-free reinforcement learning method is employed to obtain the optimal policy when the dynamic information is partially unknown, with admissibility condition of the initial policy further relaxed. Finally, two comparative simulations are presented to demonstrate the validity and superiority of the proposed approach.

AutomaticaVol. 178
Reduced inequalities
Openalex Percentile: Top 3%
Adaptive Dynamic Programming Control
7.52
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.

Distributed Nash equilibrium solution for multi-agent game in adversarial environment: A reinforcement learning method — Meng Wang, Kaitian Chen, et al. · Automatica (2025) | TGRS Research Map | TGRS