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 typed approach is one kind of natural easy implemented method to solve gnep. we study some properties for this approach, and give out a computable criterion for generalized potential game (gpgs), the condition under which the convergence of this approach could be guaranteed.