Deterministic graphical games
By: Alan R. Washburn
Contributors: Naval Postgraduate School (U.S.). Dept. of Operations Research
Publisher: Naval Postgraduate School; Available from National Technical Information Service
Published: 1986
Place of publication: Monterey, Calif; Springfield, Va
Language: eng
Number of pages: 13
Subjects: ALGORITHMS; GAME THEORY
Other titles: NPS-55-86-010.
Description: This paper gives a simple algorithm for solving a class of graphical games where infinite play is      possible. A Deterministic Graphical (DG) game is a two person zero sum game played on a      directed graph with n > o nodes. Nodes are of two kinds: terminal and continuing. Terminal      nodes are those with no successors, and have a payoff to player 1 associated with them.      Continuing nodes have at least one successor, and are labelled to indicate which player      chooses the successor. Play begins at some specified node, and continues until a terminal      node is reached. If no terminal node is ever reached, the payoff is by convention O. The      author's main intention in this paper is to describe an algorithm for solving DG games in o(n      cubed) steps.
Notes: Title from cover.

"NPS-55-86-010."

"May 1986."

AD A168 045.

Includes bibliographical references (p. 11)

aq/  /aq cc:9116 11/07/97