We consider n-person positional games with perfect information modeled by finite directed
graphs that may have directed cycles, assuming that all infinite plays form a single outcome …

We give an example of a three-person deterministic graphical game that has no Nash
equilibrium in pure stationary strategies. The game has seven positions, four outcomes (a …

A two-person positional game form g (with perfect information and without moves of chance)
is modeled by a finite directed graph (digraph) whose vertices and arcs are interpreted as …

We study restricted improvement cycles (ri-cycles) in finite positional n-person games with
perfect information modeled by directed graphs (di-graphs) that may contain directed cycles …

For the classical backward induction algorithm, the input is an arbitrary-person positional
game with perfect information modelled by a finite acyclic directed graph (digraph) and the …

We study existence of Nash equilibria (NE) in pure stationary strategies in n-person
positional games with no moves of chance, with perfect information, and with the mean or …

Recently, it was shown that Chess‐like games may have no uniform (subgame perfect)
Nash equilibria in pure positional strategies. Moreover, Nash equilibria may fail to exist …

In this short note we give an example of a four-person finite positional game with perfect
information that has no positions of chance and no Nash equilibria in pure stationary …

E) be a directed graph (digraph) and P: V= V1∪ V2∪ VT be a partition of its vertices
(positions) in three subsets: V1 and V2 are positions of players 1 and 2, respectively, and VT …

A d-graph G=(V; E1,..., Ed) is a complete graph whose edges are colored by d colors, or in
other words, are partitioned into d subsets (some of which might be empty). We say that G is …