Nash-solvable two-person symmetric cycle game forms (Q642972)

The authors consider a special class of finite 2-person positional games defined on directed graphs. They investigate conditions which provide existence of Nash equilibrium points in pure strategies. Several kinds of necessary and sufficient conditions are indicated. For instance, the total Nash solvability becomes equivalent to the solvability of all 2-connected symmetric pairs, except some special pairs and cycles. Also, it is shown that this verification can be provided with a linear time estimate. Some additional properties of minmax or maxmin strategies and uniform equilibria are also given.