nash equilibrium problems (neps) are games for several players . a nash equilibrium (ne) is a tuple of strategies such that each player's benefits cannot be improved when the other players' strategies are fixed. for neps given by polynomial functions, we formulate efficient polynomial optimization problems for computing nes. the moment-sos relaxations are used to solve them. under genericity assumptions, the method can find a nash equilibrium if there is one; it can also find all nes if there are finitely many ones. the method can also detect nonexistence if there is no ne.

this is a joint work with dr. xindong tang.