IDEAS home Printed from https://ideas.repec.org/a/spr/mathme/v101y2025i1d10.1007_s00186-024-00880-1.html
   My bibliography  Save this article

The last-success stopping problem with random observation times

Author

Listed:
  • Alexander Gnedin

    (Queen Mary University of London)

  • Zakaria Derbazi

    (Queen Mary University of London)

Abstract

Suppose N independent Bernoulli trials with success probabilities $$p_1, p_2,\ldots $$ p 1 , p 2 , … are observed sequentially at times of a mixed binomial process. The task is to maximise, by using a nonanticipating stopping strategy, the probability of stopping at the last success. The case $$p_k=1/k$$ p k = 1 / k has been studied by many authors as a version of the familiar best choice problem, where both N and the observation times are random. We consider a more general profile $$p_k=\theta /(\theta +k-1)$$ p k = θ / ( θ + k - 1 ) and assume that the prior distribution of N is negative binomial with shape parameter $$\nu $$ ν , so the arrivals occur at times of a mixed Poisson process. The setting with two parameters offers a high flexibility in understanding the nature of the optimal strategy, which we show is intrinsically related to monotonicity properties of the Gaussian hypergeometric function. Using this connection, we find that the myopic stopping strategy is optimal if and only if $$\nu \ge \theta $$ ν ≥ θ . Furthermore, we derive formulas to assess the winning probability and discuss limit forms of the problem for large N.

Suggested Citation

  • Alexander Gnedin & Zakaria Derbazi, 2025. "The last-success stopping problem with random observation times," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 101(1), pages 1-27, February.
  • Handle: RePEc:spr:mathme:v:101:y:2025:i:1:d:10.1007_s00186-024-00880-1
    DOI: 10.1007/s00186-024-00880-1
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s00186-024-00880-1
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s00186-024-00880-1?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
    ---><---

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

    References listed on IDEAS

    as
    1. Bruss, F. Thomas, 1988. "Invariant record processes and applications to best choice modelling," Stochastic Processes and their Applications, Elsevier, vol. 30(2), pages 303-316, December.
    2. 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.
    3. Browne, Sid & Bunge, John, 1995. "Random record processes and state dependent thinning," Stochastic Processes and their Applications, Elsevier, vol. 55(1), pages 131-142, January.
    4. Alexander Gnedin & Zakaria Derbazi, 2022. "Trapping the Ultimate Success," Mathematics, MDPI, vol. 10(1), pages 1-19, January.
    5. Bruss, F. Thomas & Rogers, L. C. G., 1991. "Embedding optimal selection problems in a Poisson process," Stochastic Processes and their Applications, Elsevier, vol. 38(2), pages 267-278, August.
    6. 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)

    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. 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.
    3. Kühne, Robert & Rüschendorf, Ludger, 2000. "Approximation of optimal stopping problems," Stochastic Processes and their Applications, Elsevier, vol. 90(2), pages 301-325, December.
    4. 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.
    5. Bruss, F. Thomas & Paindaveine, Davy, 2000. "Selecting a sequence of last successes in independent trials," MPRA Paper 21166, University Library of Munich, Germany.
    6. 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.
    7. Anton J. Kleywegt & Jason D. Papastavrou, 1998. "The Dynamic and Stochastic Knapsack Problem," Operations Research, INFORMS, vol. 46(1), pages 17-35, February.
    8. 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.
    9. 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.
    10. Tomomi Matsui & Katsunori Ano, 2016. "Lower Bounds for Bruss’ Odds Problem with Multiple Stoppings," Mathematics of Operations Research, INFORMS, vol. 41(2), pages 700-714, May.
    11. Alexander Gnedin & Zakaria Derbazi, 2022. "Trapping the Ultimate Success," Mathematics, MDPI, vol. 10(1), pages 1-19, January.
    12. 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.
    13. Gnedin, A.V.Alexander V., 2004. "Best choice from the planar Poisson process," Stochastic Processes and their Applications, Elsevier, vol. 111(2), pages 317-354, June.

    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:spr:mathme:v:101:y:2025:i:1:d:10.1007_s00186-024-00880-1. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.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.