Abstract

In this paper, we study strongly pseudo-monotone equilibrium problems in real Hilbert and introduce two simple subgradient-type methods for solving it. The advantages of our schemes are the simplicity of their algorithmic structure which consists of only one projection onto the feasible set and there is no need to solve any strongly convex programming problem, which is often used in related methods in the literature. Under mild and standard assumptions, strong convergence theorems of the proposed algorithms are established. We test and compare the performances of our schemes with some related methods in the literature for solving the Nash–Cournot oligopolistic equilibrium model.