A distributed Bregman forward-backward algorithm for a class of Nash equilibrium problems
From MaRDI portal
Publication:2095329
DOI10.1016/j.ejcon.2022.100686zbMath1501.91038OpenAlexW4282839416MaRDI QIDQ2095329
Sergio Grammatico, Wicak Ananduta
Publication date: 9 November 2022
Published in: European Journal of Control (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejcon.2022.100686
Noncooperative games (91A10) Algorithmic game theory and complexity (91A68) Equilibrium refinements (91A11)
Uses Software
Cites Work
- Unnamed Item
- OSQP: An Operator Splitting Solver for Quadratic Programs
- Primal-dual subgradient methods for convex problems
- Learning in games with continuous action sets and unknown payoff functions
- An operator splitting approach for distributed generalized Nash equilibria computation
- Mirror descent and nonlinear projected subgradient methods for convex optimization.
- Bregman forward-backward operator splitting
- Distributed Algorithms for Aggregative Games on Graphs
- Online Learning and Online Convex Optimization
- Bregman Monotone Optimization Algorithms
- Distributed Computation of Equilibria in Monotone Nash Games via Iterative Regularization Techniques
- Distributed Nash Equilibrium Seeking With Limited Cost Function Knowledge via a Consensus-Based Gradient-Free Method
- The Role of Population Games and Evolutionary Dynamics in Distributed Control Systems: The Advantages of Evolutionary Game Theory
- Geometric Convergence of Gradient Play Algorithms for Distributed Nash Equilibrium Seeking
- Competitive routing in networks with polynomial costs
- Convex analysis and monotone operator theory in Hilbert spaces
This page was built for publication: A distributed Bregman forward-backward algorithm for a class of Nash equilibrium problems
