地点：行健楼学术活动室526
摘要：In this paper we consider a kind of generalized Nash equilibrium problems (GNEPs) whose objective functions are polynomials, and the constraints can be represented by polynomial equalities and inequalities. Gauss-Seidel method is used to solve the special kind of generalized potential games. We prove the convergence under some assumptions. Numerical examples show that the algorithm is efficient for most of the problems.