Answers are grounded in this paper and cite their sources.
We consider the stochastic generalized Nash equilibrium problem (SGNEP) with expected-value cost functions. Inspired by Yi and Pavel (2019), we propose 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. Our main contribution is to show almost sure convergence of the proposed algorithm if the pseudogradient mapping is restricted (monotone and) cocoercive.
No takes yet. Share an insight, caveat, or question.
Franci et al. (2020) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: