A Douglas-Rachford splitting for semi-decentralized equilibrium seeking in generalized aggregative games

Giuseppe Belgioioso, Sergio Grammatico

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

4 Citations (Scopus)

Abstract

We address the generalized aggregative equilibrium seeking problem for noncooperative agents playing average aggregative games with affine coupling constraints. First, we use operator theory to characterize the generalized aggregative equilibria of the game as the zeros of a monotone set-valued operator. Then, we massage the Douglas-Rachford splitting to solve the monotone inclusion problem and derive a single layer, semi-decentralized algorithm whose global convergence is guaranteed under mild assumptions. The potential of the proposed Douglas-Rachford algorithm is shown on a simplified resource allocation game, where we observe faster convergence with respect to forward-backward algorithms.

Original languageEnglish
Title of host publication2018 IEEE Conference on Decision and Control, CDC 2018
Place of PublicationPiscataway
PublisherInstitute of Electrical and Electronics Engineers
Pages3541-3546
Number of pages6
ISBN (Electronic)978-1-5386-1395-5
DOIs
Publication statusPublished - 18 Jan 2019
Event57th IEEE Conference on Decision and Control, (CDC2018) - Miami, United States
Duration: 17 Dec 201819 Dec 2018
Conference number: 57

Conference

Conference57th IEEE Conference on Decision and Control, (CDC2018)
Abbreviated titleCDC 2018
CountryUnited States
CityMiami
Period17/12/1819/12/18

Fingerprint Dive into the research topics of 'A Douglas-Rachford splitting for semi-decentralized equilibrium seeking in generalized aggregative games'. Together they form a unique fingerprint.

Cite this