A Journal "Theory of Probability and Mathematical Statistics"
2024
2023
2022
2021
2020
2019
2018
2017
2016
2015
2014
2013
2012
2011
2010
2009
2008
2007
2006
2005
2004
2003
2002
2001
2000
1999
1998
1997
1996
1995
1994
1993
1992
1991
1990
1989
1988
1987
1986
1985
1984
1983
1982
1981
1980
1979
1978
1977
1976
1975
1974
1973
1972
1971
1970


Archive

About   Editorial Board   Contacts   Template   Publication Ethics   Peer Review Process   Special Issues   History  

Theory of Probability and Mathematical Statistics



A note on last-success-problem

J.M. Grau Ribas

Link

Abstract: We consider the Last-Success-Problem with $n$ independent Bernoulli random variables with parameters $p_i>0$. We improve the lower bound provided by F.T. Bruss for the probability of winning and provide an alternative proof to the one given in \cite {BR2} for the lower bound ($1/e$) when $R\coloneqq\sum_{i=1}^n (p_i/(1-p_i))\geq1$. We also consider a modification of the game which consists in not considering it a failure when all the random variables take the value of 0 and the game is repeated as many times as necessary until a ``$1$'' appears. { We prove that the probability of winning in this game when $R\leq1$ is lower-bounded by $0.5819\ldots=\frac{1}{e-1} $}. Finally, we consider the variant in which the player can choose between participating in the game in its standard version or predict that all the random variables will take the value 0.

Keywords: Last-Success-Problem, lower bounds, odds-theorem, optimal stopping, optimal threshold

Bibliography:
1. P. Allaart and J. A. Islas A sharp lower bound for choosing the maximum of an independent sequence, J. Appl. Prob. 53 (2016), no. 4, 1041-1051.
2. F. T. Bruss, Sum the odds to one and stop, Ann. Probab. 28 (2000), no. 3, 1384-1391.
3. F. T. Bruss, A note on bounds for the odds theorem of optimal stopping, Ann. Probab. 31 (2003), no. 4, 1859-1861.
4. F. T. Bruss, Odds-theorem and monotonicity, Math. Applicanda 47 (2019), no. 1, 25-43.
5. T. S. Ferguson, The sum-the-odds theorem with application to a stopping game of Sakaguchi, Math. Appl. 44 (2016), no. 1, 45-61.
6. T. S. Ferguson, Optimal stopping and applications, Electronic Text at http://www.math.ucla.edu/stom/Stopping/Contents.html (2006).
7. J. M. Grau Ribas, An extension of the Last-Success-Problem, Stat. Probab. Lett. 156 (2020), Article 108591.
8. J. M. Grau Ribas, A turn-based game related to the Last-Success-Problem, Dyn. Games Appl. 10 (2019), no. 4, 836-844.
9. T. P. Hill and U. Krengel, A prophet inequality related to the secretary problem, Contemp. Math. 125 (1992), 209-215.
10. S. R. Hsiau and J. R. Yang, A natural variation of the standard secretary problem, Statist. Sinica. 10 (2000), 639-646.
11. W. Kohn, Last Success Problem: Decision Rule and Application, Available at SSRN: https://ssrn.com/abstract=2441250 or http://dx.doi.org/10.2139/ssrn.2441250 (2014).