Abstract In this paper, we present three distributed algorithms to solve a class of Generalized Nash Equilibrium (GNE) seeking problems in strongly monotone games. The first one (SD-GENO) is based on synchronous updates the agents, while second and third (AD-GEED AD-GENO) represent asynchronous solutions that are robust communication delays. AD-GENO can be seen as refinement AD-GEED, since it o...