Nash equilibrium seeking over directed graphs
Abstract In this paper, we aim to develop distributed continuous-time algorithms over directed graphs to seek the Nash equilibrium in a noncooperative game. Motivated by the recent consensus-based designs, we present a distributed algorithm with a proportional gain for weight-balanced directed graph...
Main Authors: | Yutao Tang, Peng Yi, Yanqiong Zhang, Dawei Liu |
---|---|
Format: | Article |
Language: | English |
Published: |
Springer
2022-04-01
|
Series: | Autonomous Intelligent Systems |
Subjects: | |
Online Access: | https://doi.org/10.1007/s43684-022-00026-2 |
Similar Items
-
Nash Equilibrium Seeking with Non-doubly Stochastic Communication Weight Matrix
by: Farzad Salehisadaghiani, et al.
Published: (2020-06-01) -
Nash equilibrium seeking with prescribed performance
by: Sun, Chao, et al.
Published: (2024) -
Exponentially convergent distributed Nash equilibrium seeking for constrained aggregative games
by: Shu Liang, et al.
Published: (2022-04-01) -
Nash equilibrium set function in dyadic mixed-strategy games
by: Valeriu Ungureanu
Published: (2017-02-01) -
Alternating Inertial and Overrelaxed Algorithms for Distributed Generalized Nash Equilibrium Seeking in Multi-Player Games
by: Zhangcheng Feng, et al.
Published: (2021-06-01)