the generalized nash equilibrium problem (gnep) is a kind of games to find strategies for a group of players such that each player’s objective function is optimized, given other players’ strategies. if all the objective and constraining functions involved are polynomials, we call the problem a generalized nash equilibrium problem of polynomials (gnepp). when the constraining functions of each player are independent of other player’s strategies, the gnep is called a (standard) nash equilibrium problem (nep). the gnep is said to be convex if each player’s optimization is a convex optimization problem, given other players’ strategies. \\ \\ for nonconvex nash equilibrium problems that are given by polynomial functions, we formulate efficient polynomial optimization problems for computing nash equilibria. we show that under generic assumptions, the method can find one or even all nash equilibria if they exist, or detect nonexistence of nash equilibria. for convex gnepps, we introduce rational and parametric expressions for lagrange multipliers to formulate polynomial optimization for computing generalized nash equilibria (gnes). we prove that under some specific assumptions, the method can find a gne if there exists one, or detect nonexistence of gnes. numerical experiments are presented to show the efficiency of the methods. the moment-sos hierarchy of semidefinite relaxations are used to solve the polynomial optimization. \\ \\ moreover, we study the gauss-seidel method for solving the nonconvex gnepps. we give a certificate for a class of gnepps such that the gauss-seidel method is guaranteed to converge, and the numerical experiments show that the gauss-seidel method can solve many gnepps efficiently.