Search

The generalized Nash equilibriumproblem(GNEP) is anextensionof the standard Nash equilibrium problem(NEP), inwhich each player's strategy set may depend on the rival player's strategies. In this paper, we present two descent type methods. The algorithms are based on a reformulation of the generalized Nash equilibrium using Nikaido-Isoda function as unconstrained optimization. We prove that our algorithms are globally convergent and the convergence analysis is not based on conditions guaranteeing that every stationary point of the optimization problem is a solution of the GNEP. [ABSTRACT FROM AUTHOR]

We introduce a general iterative algorithm for finding a common element of the common fixedpoint set of an infinite family of ?i-strict pseudocontractions and the solution set of a general system of variational inclusions for two inverse strongly accretive operators in a q-uniformly smooth Banach space. Then, we prove a strong convergence theorem for the iterative sequence generated by the proposed iterative algorithm under very mild conditions. The methods in the paper are novel and different from those in the early and recent literature. Our results can be viewed as the improvement, supplementation, development, and extension of the corresponding results in some references to a great extent. [ABSTRACT FROM AUTHOR]