DeepAI
Log In Sign Up

Stochastic generalized Nash equilibrium seeking in merely monotone games

02/18/2020
by   Barbara Franci, et al.
0

We solve the stochastic generalized Nash equilibrium (SGNE) problem in merely monotone games with expected value cost functions. Specifically, we present the first distributed SGNE seeking algorithm for monotone games that only requires one proximal computation (e.g., one projection step) and only one pseudogradient evaluation per iteration. Our main contribution is to build upon the relaxed forward-backward operator splitting by Malitsky (Mathematical programming, 2019) and in turn to show almost sure convergence to a SGNE when the expected value of the pseudogradient is approximated by the average over a number of random samples.

READ FULL TEXT

page 1

page 2

page 3

page 4

12/09/2019

Distributed Forward-Backward algorithms for stochastic generalized Nash equilibrium seeking

We consider the stochastic generalized Nash equilibrium problem (SGNEP) ...
10/25/2019

A damped forward-backward algorithm for stochastic generalized Nash equilibrium seeking

We consider a stochastic generalized Nash equilibrium problem (GNEP) wit...
12/17/2019

Controlling network coordination games

We study a novel control problem in the context of network coordination ...
09/30/2012

On The Convergence of a Nash Seeking Algorithm with Stochastic State Dependent Payoff

Distributed strategic learning has been getting attention in recent year...