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

In this article, 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 aims 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 partial-decision information setting based on the Douglas–Rachford operator splitting scheme, which relaxes assumptions in the existing literature. The proposed algorithm updates players' local decisions through augmented best-response schemes and subsequent projections onto the local feasible sets, which comprise most of the computational workload. The projected stochastic subgradient method is applied to provide approximate solutions to the augmented best-response subproblems for each player. The Robbins–Siegmund theorem is leveraged to establish the main convergence results to a true Nash equilibrium using the proposed inexact solver. Finally, we illustrate the validity of the proposed algorithm via two numerical examples: 1) a stochastic Nash–Cournot distribution game and 2) a multiproduct assembly problem with the two-stage model.