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.

    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.

    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: 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.