Distributed GNE Seeking Under Partial-Decision Information Over Networks via a Doubly-Augmented Operator Splitting Approach
From MaRDI portal
Publication:5125576
Cited in
(30)- Nash equilibrium seeking in N-coalition games via a gradient-free method
- Fast generalized Nash equilibrium seeking under partial-decision information
- Multi-agent control: a graph-theoretic perspective
- Stochastic generalized Nash equilibrium seeking under partial-decision information
- Dynamic generalized Nash equilibrium seeking for \(N\)-coalition noncooperative games
- Nash equilibrium seeking in full-potential population games under capacity and migration constraints
- Distributed convergence to Nash equilibria in network and average aggregative games
- Continuous-time distributed Nash equilibrium seeking algorithms for non-cooperative constrained games
- Continuous-time fully distributed generalized Nash equilibrium seeking for multi-integrator agents
- Generalized multi-cluster game under partial-decision information with applications to management of energy Internet
- Generalized Nash equilibrium seeking for networked noncooperative games with a dynamic event-triggered mechanism
- Distributed generalized Nash equilibrium seeking for noncooperative games with unknown cost functions
- Distributed dynamics for aggregative games: Robustness and privacy guarantees
- Distributed Nash equilibrium learning: A second‐order proximal algorithm
- Distributed Nash equilibrium seeking on compact action sets over jointly strongly connected switching networks
- Distributed generalized Nash equilibrium seeking: a backward-reflected-forward-backward-based algorithm
- A timestamp-based projected gradient play for distributed Nash equilibrium seeking in monotone games
- Distributed GNE seeking under partial-decision information over networks via a doubly-augmented operator splitting approach
- Edge-based distributed primal-dual algorithms for seeking generalized Nash equilibria
- Distributed inertial online game algorithm for tracking generalized Nash equilibria
- A linearly convergent distributed heavy-ball GNE seeking algorithm for aggregative games over weight-unbalanced digraphs via finite-time consensus
- Distributed Nash equilibrium computation in multi-group resource allocation games over digraphs
- Distributed control to steer dynamical systems to the generalized Nash equilibria for monotone aggregative games with operational constraints
- A distributed Nesterov's approach for fast Nash equilibrium seeking in noncooperative games
- Online distributed algorithms for aggregative games with stochastic costs over time-varying networks
- Efficient distributed learning in stochastic non-cooperative games without information exchange
- Differentially private distributed Nash equilibrium seeking based on gradient tracking and communication compression
- Distributed aggregative optimization with affine coupling constraints
- Asynchronous distributed generalized Nash equilibrium computation for aggregative games with coupling constraint
- Prescribed-time Nash equilibrium seeking for constrained multi-coalition games with heterogeneous players subject to parameter uncertainties
This page was built for publication: Distributed GNE Seeking Under Partial-Decision Information Over Networks via a Doubly-Augmented Operator Splitting Approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5125576)
