Equilibria in Nonantagonistic Positional Games on Graphs and Searching for Them

We distinguish some cases of existence of a stationary equilibrium in nonantagonistic games on directed graphs with terminal payoffs along trajectories. The proof of the existence of stationary equilibria implies polynomial search algorithms for them.