N-M STABLE SET OF A REGULAR GAME AND ITS UNIQUE EXISTENCE THEOREM
正则对策的N-M稳定集及其唯一存在定理

This paper is concerned with infinite strategic games with asymmetric and negatively transitive preferences. An N-M stable set in a strategic game is introduced by the analogous way given by von Neumann and Morgenstern in cooperative games. An infinite strategic game is regular if every chain in the set of Nash equilibria with respect to the uniform preference is upper bounded. It is shown that every regular game has a unique N-M stable set. The result and its applied example show that the concept of N-M stable set in regular games plays an important role to refine pure Nash equilibria.