This paper studies the stochastic generalized Nash equilibrium (SGNE) seeking problem for merely monotone games, where each player minimizes their own expected-value cost function subject to local and shared coupling constraints. Using the operator splitting technique, we restate the problem as seeking the zero of the sum of monotone operators. Then, we propose a novel distributed SGNE seeking algorithm based on a newly improved forward-backward-forward operator splitting, which performs one pseudo-gradient approximation computation and one communication round over the communication graph at each iteration. By theoretical analysis, we prove that the iterates generated by the designed algorithm converge to a variational SGNE almost surely if the expected value of the pseudo-gradient is approximated by the average of several random samples. Finally, the designed algorithm is also verified via numerical experiments on a wireless Ad-Hoc network.
