Deterministic graphical games
Our rough guess is there are 3,250 words in this book.
At a pace averaging 250 words per minute, this book will take 0 hours and 13 minutes to read. With a half hour per day, this will take 1 days to read.
How long will it take you?
This book will take an estimated to read at a reading speed averaging words per minute. With 30 minutes per day, this will take to read.
Enter your reading speedYou can take one of our WPM reading speed tests to find your reading speed.
Create a free account to track your reading progress, build your reading list, and set reading goals.
Author
Contributions
- Naval Postgraduate School (U.S.). Dept. of Operations Research - Contributor
Publication
1986 - Naval Postgraduate School, Monterey, Calif, California
Language
English
Word Count
3,250 words, Guess
Page Count
13 pages
Identifiers
- Internet Archivedeterministicgra00wash
- Open LibraryOL25496387M
Alternate 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.
Subjects
Topics
Reader Reviews
No reviews yet for this book.
Be the first to share your thoughts!