Optimization of Multitype Branching Processes

We consider either a discrete time or an age-dependent branching process where the population consists of k types of individuals. Each time an individual is born, an action is chosen, for him which affects his lifetime, the number and types of his offspring, and the reward received. The problem of maximizing the expected reward is shown to be equivalent to a generalized Markov decision problem where the (k × k) transition, matrices are non-negative but not necessarily substochastic. It is shown that this branching process decision model can account for immigration, that it can be viewed as a controlled population process or infinite particle system, and that it has a number of applications including marketing and biology.

• 저널Management Science · 23(2) · 117–124
• 토픽Stochastic processes and statistical mechanics · Mathematical Physics
• DOI10.1287/mnsc.23.2.117
• 저자Stanley R. Pliska