Two-person games on graphs

AbstractEvery vertex of an abstract-directed graph is characterized in terms of a two-person game. A vertex is winning if by choosing it a player can assure himself of a win, it is losing if by choosing it he cannot prevent his opponent from winning, and it is drawing if it is neither winning nor losing. The sets of winning, losing, and drawing vertices are identified in terms of a set-valued function on the graph