IDEAS home Printed from https://ideas.repec.org/a/eee/spapps/v15y1983i3p317-325.html
   My bibliography  Save this article

Maximizing the length of a success run for many-armed bandits

Author

Listed:
  • Berry, Donald A.
  • Fristedt, Bert

Abstract

One of a number of Bernoulli processes is selected at each of a number of stages. A success at stage i is worth [alpha]i and the problem is to maximize the expected payoff before the first failure. Results of Berry and Viscusi (1981) are generalized. In particular, we show that there is always an optimal strategy that uses a single process exclusively and indefinitely whenever the arms are independent and the discount sequence ([alpha]1, [alpha]2,...) is superregular. There is not always a similar reduction in the number of strategies when the discount sequence is not superregular.

Suggested Citation

  • Berry, Donald A. & Fristedt, Bert, 1983. "Maximizing the length of a success run for many-armed bandits," Stochastic Processes and their Applications, Elsevier, vol. 15(3), pages 317-325, August.
    • Handle: RePEc:eee:spapps:v:15:y:1983:i:3:p:317-325
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/0304-4149(83)90039-X
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    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:eee:spapps:v:15:y:1983:i:3:p:317-325. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/505572/description#description .

    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.