Learning equilibria with personalized incentives in a class of nonmonotone games
Not on the map. Why?
Abstract (arXiv)
We consider quadratic, nonmonotone generalized Nash equilibrium problems with symmetric interactions among the agents. Albeit this class of games is known to admit a potential function, its formal expression can be unavailable in several real-world applications. For this reason, we propose a two-layer Nash equilibrium seeking scheme in which a central coordinator exploits noisy feedback from the agents to design personalized incentives for them. By making use of those incentives, the agents compute a solution to an extended game, and then return feedback measures to the coordinator. We show that our algorithm returns an equilibrium if the coordinator is endowed with standard learning policies, and corroborate our results on a numerical instance of a hypomonotone game.
Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 11 of its 34 references that are in the map. First posted on arXiv 6 Nov 2021.
Builds on
11 of 34 references.
References · 11
- 2017How to Escape Saddle Points Efficientlycited by 285
- 2018Stochastic model-based minimization of weakly convex functionscited by 159
- 2018Online Learning with Inexact Proximal Online Gradient Descent Algorithmscited by 22
- 2016Distributed Nash Equilibrium Seeking by A Consensus Based Approachcited by 8
- 2020Distributed Personalized Gradient Tracking with Convex Parametric Modelscited by 7
- 2019Personalized Optimization with User's Feedbackcited by 5
- 2019Charging plug-in electric vehicles as a mixed-integer aggregative gamecited by 4
- 2020Solving non-monotone equilibrium problems via a DIRECT-type approachcited by 2
- 2020Personalized Demand Response via Shape-Constrained Online Learningcited by 2
- 2021On the exact convergence to Nash equilibrium in hypomonotone regimes under full and partial-informationcited by 2
- 2018Nash equilibrium seeking in potential games with double-integrator agentscited by 1
Built on by
Citing papers per year: 2022: 2.
2 papers.