On the optimal selection of generalized Nash equilibria in linearly coupled aggregative games

Conference paper (2022)

Authors

E. Benenati Team Sergio Grammatico - Mechanical, Maritime and Materials Engineering
W. Ananduta Team Sergio Grammatico - Mechanical, Maritime and Materials Engineering
S. Grammatico , Team Sergio Grammatico - Mechanical, Maritime and Materials Engineering
Research Group
Team Sergio Grammatico (Mechanical, Maritime and Materials Engineering) (TU Delft)
More Info
expand_more

Published Date

2022

Language

English

Reuse Rights

Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.

Faculty

Mechanical, Maritime and Materials Engineering

Department

Delft Center for Systems and Control

Research Group

Team Sergio Grammatico

Abstract

Monotone aggregative games may admit multiple (variational) generalized Nash equilibria, yet currently there is no algorithm able to provide an a-priori characterization of the equilibrium solution actually computed. In this paper, we formulate for the first time the problem of selecting a specific variational equilibrium that is optimal with respect to a given objective function. We then propose a semi-decentralized algorithm for optimal equilibrium selection in linearly coupled aggregative games and prove its convergence.

Files

On_the_optimal_selection_of_ge... (pdf)
(pdf | 1.49 Mb)
- Embargo expired in 10-07-2023
Unknown license