Max-Min problems are two-step allocation problems in which one side must make his move knowing that the other side will then learn what the move is and optimally counter. They are fundamental in parti cular to military weapons-selection problems involving large systems such as Minuteman or Polaris, where the systems in the mix are so large that they cannot be concealed from an opponent. One must then expect the opponent to determine on an optlmal mixture of, in the case men tioned above, anti-Minuteman and anti-submarine effort. The author's first introduction to a problem of Max-Min type...
Max-Min problems are two-step allocation problems in which one side must make his move knowing that the other side will then learn what the move is an...
This book is devoted to the systematic exposition of the contemporary theory of controlled Markov processes with discrete time parameter or in another termi- nology multistage Markovian decision processes. We discuss the applications of this theory to various concrete problems. Particular attention is paid to mathe- matical models of economic planning, taking account of stochastic factors. The authors strove to construct the exposition in such a way that a reader interested in the applications can get through the book with a minimal mathe- matical apparatus. On the other hand, a mathematician...
This book is devoted to the systematic exposition of the contemporary theory of controlled Markov processes with discrete time parameter or in another...