IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v10y2022i1p158-d718112.html
   My bibliography  Save this article

Trapping the Ultimate Success

Author

Listed:
  • Alexander Gnedin

    (School of Mathematical Sciences, Queen Mary University of London, London E1 4NS, UK)

  • Zakaria Derbazi

    (School of Mathematical Sciences, Queen Mary University of London, London E1 4NS, UK)

Abstract

We introduce a betting game where the gambler aims to guess the last success epoch in a series of inhomogeneous Bernoulli trials paced randomly in time. At a given stage, the gambler may bet on either the event that no further successes occur, or the event that exactly one success is yet to occur, or may choose any proper range of future times (a trap). When a trap is chosen, the gambler wins if the last success epoch is the only one that falls in the trap. The game is closely related to the sequential decision problem of maximising the probability of stopping on the last success. We use this connection to analyse the best-choice problem with random arrivals generated by a Pólya-Lundberg process.

Suggested Citation

  • Alexander Gnedin & Zakaria Derbazi, 2022. "Trapping the Ultimate Success," Mathematics, MDPI, vol. 10(1), pages 1-19, January.
  • Handle: RePEc:gam:jmathe:v:10:y:2022:i:1:p:158-:d:718112
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/10/1/158/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/2227-7390/10/1/158/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Mitsushi Tamaki & Qi Wang, 2010. "A Random Arrival Time Best-Choice Problem with Uniform Prior on the Number of Arrivals," Springer Optimization and Its Applications, in: Altannar Chinchuluun & Panos M. Pardalos & Rentsen Enkhbat & Ider Tseveendorj (ed.), Optimization and Optimal Control, pages 499-510, Springer.
    2. T. J. Stewart, 1981. "The Secretary Problem with an Unknown Number of Options," Operations Research, INFORMS, vol. 29(1), pages 130-145, February.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. Emanuele Dolera, 2022. "Preface to the Special Issue on “Bayesian Predictive Inference and Related Asymptotics—Festschrift for Eugenio Regazzini’s 75th Birthday”," Mathematics, MDPI, vol. 10(15), pages 1-4, July.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Gnedin, Alexander, 2022. "The best choice problem with random arrivals: How to beat the 1/e-strategy," Stochastic Processes and their Applications, Elsevier, vol. 145(C), pages 226-240.
    2. Das, Sanmay & Tsitsiklis, John N., 2010. "When is it important to know you've been rejected? A search problem with probabilistic appearance of offers," Journal of Economic Behavior & Organization, Elsevier, vol. 74(1-2), pages 104-122, May.
    3. Anton J. Kleywegt & Jason D. Papastavrou, 1998. "The Dynamic and Stochastic Knapsack Problem," Operations Research, INFORMS, vol. 46(1), pages 17-35, February.
    4. Anton J. Kleywegt & Jason D. Papastavrou, 2001. "The Dynamic and Stochastic Knapsack Problem with Random Sized Items," Operations Research, INFORMS, vol. 49(1), pages 26-41, February.
    5. Ferenstein, Elzbieta Z. & Krasnosielska, Anna, 2010. "No-information secretary problems with cardinal payoffs and Poisson arrivals," Statistics & Probability Letters, Elsevier, vol. 80(3-4), pages 221-227, February.
    6. Seale, Darryl A. & Rapoport, Amnon, 1997. "Sequential Decision Making with Relative Ranks: An Experimental Investigation of the "Secretary Problem">," Organizational Behavior and Human Decision Processes, Elsevier, vol. 69(3), pages 221-236, March.
    7. Bruss, F. Thomas & Rogers, L.C.G., 2022. "The 1/e-strategy is sub-optimal for the problem of best choice under no information," Stochastic Processes and their Applications, Elsevier, vol. 150(C), pages 1059-1067.

    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:gam:jmathe:v:10:y:2022:i:1:p:158-:d:718112. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    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.