Graphs, Dynamic Programming, and Finite Games

This document was uploaded by one of our users. The uploader already confirmed that they had the permission to publish it. If you are author/publisher or own the copyright of this documents, please report to us by using this DMCA report form.

Simply click on the Download Book button.

Yes, Book downloads on Ebookily are 100% Free.

Sometimes the book is free on Amazon As well, so go ahead and hit "Search on Amazon"

Author(s): Richard Bellman (Eds.)
Series: Mathematics in Science and Engineering 36
Publisher: Elsevier, Academic Press
Year: 1967

Language: English
Pages: ii-xiv, 3-484

Content:
Edited by
Pages ii-iii

Copyright page
Page vi

Dedication
Page vii

Foreward
Page ix
Richard Bellman

Foreward to the French Edition
Page xi
Henry Bergson

Preface to the French Edition
Pages xiii-xiv
A. Kaufmann

Chapter I Graphs
Pages 3-75

Chapter II Dynamic Programming
Pages 76-149

Chapter III The Theory of Games of Strategy
Pages 150-223

Symbols for the Theory of Sets Used in Part II
Pages 227-228

Chapter IV The Principal Properties of Graphs
Pages 229-329

Chapter V Mathematical Properties of Dynamic Programming
Pages 330-405

Chapter VI Mathematical Properties of Games of Strategy
Pages 406-472

Bibliography
Pages 473-479

Subject Index
Pages 481-484