Deterministic graphical games (Q2277168): Difference between revisions

The author studies antagonistic games of perfect information played on finite directed graphs. The possibility of infinite play is not excluded. An efficient algorithm for calculating an equilibrium point of the game is presented and analyzed. Similar games, even on not necessarily finite graphs, have been studied in detail, but not from the computational point of view, by \textit{B. Kummer} [``Spiele auf Graphen'' (1980; Zbl 0486.90086)].