Time-varying constrained proximal type dynamics in multi-agent network games

Carlo Cenedese, Giuseppe Belgioioso, Sergio Grammatico, Ming Cao

Research output: Chapter in Book/Conference proceedings/Edited volumeConference contributionScientificpeer-review

Abstract

In this paper, we study multi-agent network games subject to affine time-varying coupling constraints and a time-varying communication network. We focus on the class of games adopting proximal dynamics and study their convergence to a persistent equilibrium. The assumptions considered to solve the problem are discussed and motivated. We develop an iterative equilibrium seeking algorithm, using only local information, that converges to a special class of game equilibria. Its derivation is motivated by several examples, showing that the original game dynamics fail to converge. Finally, we apply the designed algorithm to solve a constrained consensus problem, illustrating the theoretical results.

Original languageEnglish
Title of host publicationProceedings of the European Control Conference 2020, ECC 2020
Place of PublicationPiscataway, NJ, USA
PublisherIEEE
Pages148-153
ISBN (Electronic)978-3-907144-01-5
ISBN (Print)978-3-907144-02-2
Publication statusPublished - 2020
Event18th European Control Conference, ECC 2020 - Saint Petersburg, Russian Federation
Duration: 12 May 202015 May 2020

Conference

Conference18th European Control Conference, ECC 2020
CountryRussian Federation
CitySaint Petersburg
Period12/05/2015/05/20

Fingerprint Dive into the research topics of 'Time-varying constrained proximal type dynamics in multi-agent network games'. Together they form a unique fingerprint.

Cite this