Distributed event-triggered generalized Nash equilibrium seeking for aggregative games on unbalanced digraphs

This paper addresses the problem of seeking generalized Nash equilibrium for constrained aggregative games with double-integrator agents who communicate with each other on an unbalanced directed graph. An auxiliary variable is introduced to balance the consensus terms in the designed algorithm by es...

Full description

Saved in:
Bibliographic Details
Published in:Archives of control sciences 2022-01, Vol.32 (4), p.783-800
Main Authors: Cai, Xin, Nan, Xinyuan, Gao, Bingpeng
Format: Article
Language:English
Subjects:
aggregative games
Algorithms
Asymptotic properties
Communication
Communications networks
coupled constraints
Design
Double integrators
Eigenvalues
Eigenvectors
Equilibrium
Game theory
Games
generalized nash equilibrium
Graph theory
Graphs
multiagent systems
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This paper addresses the problem of seeking generalized Nash equilibrium for constrained aggregative games with double-integrator agents who communicate with each other on an unbalanced directed graph. An auxiliary variable is introduced to balance the consensus terms in the designed algorithm by estimating the left eigenvector of the Laplacian matrix associated with the zero eigenvalue in a distributed manner. Moreover, an event-triggered broadcasting scheme is proposed to reduce communication loads in the network. It is shown that the proposed communication scheme is free of the Zeno behavior and the asymptotic convergence of the designed algorithm is obtained. Simulation results are demonstrated to validate the proposed methods.
ISSN:1230-2384
2300-2611
DOI:10.24425/acs.2022.143671