Distributed Generalized Nash Equilibrium Seeking in Aggregative Games on Time-Varying Networks

Giuseppe Belgioioso, Angelia Nedic, Sergio Grammatico

Research output: Contribution to journalArticlepeer-review

3 Scopus citations

Abstract

We design the first fully distributed algorithm for generalized Nash equilibrium seeking in aggregative games on a time-varying communication network, under partial-decision information, i.e., the agents have no direct access to the aggregate decision. The algorithm is derived by integrating dynamic tracking into a projected pseudo-gradient algorithm. The convergence analysis relies on the framework of monotone operator splitting and the Krasnosel'skii-Mann fixed-point iteration with errors.

Original languageEnglish (US)
Article number9130079
Pages (from-to)2061-2075
Number of pages15
JournalIEEE Transactions on Automatic Control
Volume66
Issue number5
DOIs
StatePublished - May 2021
Externally publishedYes

Keywords

  • Distributed algorithms
  • multiagent systems
  • network theory
  • optimization method

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Computer Science Applications
  • Electrical and Electronic Engineering

Fingerprint

Dive into the research topics of 'Distributed Generalized Nash Equilibrium Seeking in Aggregative Games on Time-Varying Networks'. Together they form a unique fingerprint.

Cite this