On the robustness of equilibria in generalized aggregative games

We assess the robustness of equilibria in generalized Nash equilibrium problems in aggregative form subject to linear coupling constraints affected by uncertainty with a possibly unknown probability distribution. Within a data-driven context, we apply the scenario approach paradigm to provide a-post...

Olles dieđut

Bibliográfalaš dieđut
Váldodahkkit: Fabiani, F, Margellos, K, Goulart, P
Materiálatiipa: Conference item
Giella:English
Almmustuhtton: IEEE 2021
_version_ 1826291924629192704
author Fabiani, F
Margellos, K
Goulart, P
author_facet Fabiani, F
Margellos, K
Goulart, P
author_sort Fabiani, F
collection OXFORD
description We assess the robustness of equilibria in generalized Nash equilibrium problems in aggregative form subject to linear coupling constraints affected by uncertainty with a possibly unknown probability distribution. Within a data-driven context, we apply the scenario approach paradigm to provide a-posteriori feasibility certificates for the entire set of generalized Nash equilibria of the game. We then show that assessing the violation probability of such a set only requires one to enumerate the constraints that "shape" it. For the class of aggregative games, this results in solving a feasibility problem on each active facet of the feasibility region, for which we propose a semi-decentralized, structure-preserving algorithm.
first_indexed 2024-03-07T03:06:48Z
format Conference item
id oxford-uuid:b2d1dc39-bc7a-4378-a4e0-af7fad1cfb56
institution University of Oxford
language English
last_indexed 2024-03-07T03:06:48Z
publishDate 2021
publisher IEEE
record_format dspace
spelling oxford-uuid:b2d1dc39-bc7a-4378-a4e0-af7fad1cfb562022-03-27T04:14:30ZOn the robustness of equilibria in generalized aggregative gamesConference itemhttp://purl.org/coar/resource_type/c_5794uuid:b2d1dc39-bc7a-4378-a4e0-af7fad1cfb56EnglishSymplectic ElementsIEEE2021Fabiani, FMargellos, KGoulart, PWe assess the robustness of equilibria in generalized Nash equilibrium problems in aggregative form subject to linear coupling constraints affected by uncertainty with a possibly unknown probability distribution. Within a data-driven context, we apply the scenario approach paradigm to provide a-posteriori feasibility certificates for the entire set of generalized Nash equilibria of the game. We then show that assessing the violation probability of such a set only requires one to enumerate the constraints that "shape" it. For the class of aggregative games, this results in solving a feasibility problem on each active facet of the feasibility region, for which we propose a semi-decentralized, structure-preserving algorithm.
spellingShingle Fabiani, F
Margellos, K
Goulart, P
On the robustness of equilibria in generalized aggregative games
title On the robustness of equilibria in generalized aggregative games
title_full On the robustness of equilibria in generalized aggregative games
title_fullStr On the robustness of equilibria in generalized aggregative games
title_full_unstemmed On the robustness of equilibria in generalized aggregative games
title_short On the robustness of equilibria in generalized aggregative games
title_sort on the robustness of equilibria in generalized aggregative games
work_keys_str_mv AT fabianif ontherobustnessofequilibriaingeneralizedaggregativegames
AT margellosk ontherobustnessofequilibriaingeneralizedaggregativegames
AT goulartp ontherobustnessofequilibriaingeneralizedaggregativegames