• Corpus ID: 239010034

Distributed Computation of Stochastic GNE with Partial Information: An Augmented Best-Response Approach

  title={Distributed Computation of Stochastic GNE with Partial Information: An Augmented Best-Response Approach},
  author={Yuanhanqing Huang and Jianghai Hu},
  • Yuanhanqing Huang, Jianghai Hu
  • Published 25 September 2021
  • Engineering, Computer Science, Mathematics
In this paper, we focus on the stochastic generalized Nash equilibrium problem (SGNEP) which is an important and widely-used model in many different fields. In this model, subject to certain global resource constraints, a set of self-interested players aim to optimize their local objectives that depend on their own decisions and the decisions of others and are influenced by some random factors. We propose a distributed stochastic generalized Nash equilibrium seeking algorithm in a… 

Figures from this paper


An operator splitting approach for distributed generalized Nash equilibria computation
A distributed algorithm for computation of a generalized Nash equilibrium (GNE) in noncooperative games over networks in which the feasible decision sets of all players are coupled together by a globally shared affine constraint is proposed.
Distributed GNE Seeking Under Partial-Decision Information Over Networks via a Doubly-Augmented Operator Splitting Approach
  • L. Pavel
  • Computer Science, Mathematics
    IEEE Transactions on Automatic Control
  • 2020
A single-layer algorithm is introduced, fully distributed with respect to both primal and dual variables, and its convergence to a variational GNE with fixed step sizes is shown, by reformulating it as a forward–backward iteration for a pair of doubly-augmented monotone operators.
A fully-distributed proximal-point algorithm for Nash equilibrium seeking with linear convergence rate
This work designs a fully-distributed, single-layer, fixed-step algorithm based on a proximal best-response augmented with consensus terms, which outperforms the fastest known gradient-based schemes, both in terms of guaranteed convergence rate, via theoretical analysis, and in practice, via numerical simulations.
Stochastic generalized Nash equilibrium seeking under partial-decision information
It is proved that the algorithms converge to a generalized Nash equilibrium when the forward operator is restricted cocoercive by using the stochastic approximation scheme with variance reduction to estimate the expected value of the pseudogradient.
Distributed Generalized Nash Equilibria Computation of Monotone Games via Double-Layer Preconditioned Proximal-Point Algorithms
  • Peng Yi, L. Pavel
  • Computer Science, Mathematics
    IEEE Transactions on Control of Network Systems
  • 2019
This paper designs novel center-free distributed GNE seeking algorithms for equality and inequality affine coupling constraints, respectively, and proves their convergence by showing that the two algorithms can be seen as specific instances of preconditioned proximal point algorithms for finding zeros of monotone operators.
Distributed convergence to Nash equilibria in network and average aggregative games
A class of distributed algorithms that can be used to steer the strategies of the rational agents to a Nash equilibrium configuration, with guaranteed convergence under different sufficient conditions depending on the cost functions and on the network is proposed.
A Distributed Forward–Backward Algorithm for Stochastic Generalized Nash Equilibrium Seeking
This work proposes a distributed generalized Nash equilibrium seeking algorithm based on the preconditioned forward–backward operator splitting for SGNEPs, where, at each iteration, the expected value of the pseudogradient is approximated via a number of random samples.
Projected-gradient algorithms for Generalized Equilibrium seeking in Aggregative Games arepreconditioned Forward-Backward methods
We show that projected-gradient methods for the distributed computation of generalized Nash equilibria in ag- gregative games are preconditioned forward-backward splitting methods appliedto the KKT
Distributed Generalized Nash Equilibrium Seeking in Aggregative Games on Time-Varying Networks
We design the first fully distributed algorithm for generalized Nash equilibrium seeking in aggregative games on a time-varying communication network, under partial-decision information, i.e., the
Optimal stochastic extragradient schemes for pseudomonotone stochastic variational inequality problems and their variants
This work presents an extragradient-based stochastic approximation scheme and proves that the iterates converge to a solution of the original problem under either pseudomonotonicity requirements or a suitably defined acute angle condition.