IDEAS home Printed from https://ideas.repec.org/a/inm/ormnsc/v23y1976i2p117-124.html
   My bibliography  Save this article

Optimization of Multitype Branching Processes

Author

Listed:
  • Stanley R. Pliska

    (Northwestern University)

Abstract

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 \times 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.

Suggested Citation

  • Stanley R. Pliska, 1976. "Optimization of Multitype Branching Processes," Management Science, INFORMS, vol. 23(2), pages 117-124, October.
    • Handle: RePEc:inm:ormnsc:v:23:y:1976:i:2:p:117-124
    DOI: 10.1287/mnsc.23.2.117
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.23.2.117
    Download Restriction: no
    File URL: https://libkey.io/10.1287/mnsc.23.2.117?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Eugene A. Feinberg & Jefferson Huang, 2019. "On the reduction of total‐cost and average‐cost MDPs to discounted MDPs," Naval Research Logistics (NRL), John Wiley & Sons, vol. 66(1), pages 38-56, February.
    2. Kousha Etessami & Alistair Stewart & Mihalis Yannakakis, 2020. "Polynomial Time Algorithms for Branching Markov Decision Processes and Probabilistic Min(Max) Polynomial Bellman Equations," Mathematics of Operations Research, INFORMS, vol. 45(1), pages 34-62, February.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:ormnsc:v:23:y:1976:i:2:p:117-124. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.