×

Recognising the last record of sequence. (English) Zbl 1156.60025

The best-choice problem can be formulated in terms of embedded process of records, because the overall extreme is the last record observation. In the paper the occurrence of records is modeling by means of a nonincreasing right-continuous Markov process \(R=(R_t, t\geq 0)\) with the following type of behavior: given the current state is \(r>0\), the process jumps at rate \(r\) to a new state \(rX\), where \(X\) has an arbitrary distribution on the unit interval. They construct the optimal policy \(\pi_s\) which prescribes stopping at the first record time when \((T-t)R_t\leq s\) holds and in special case of parametric family of problems derive an explicit formula for the maximum probability of recognizing the last record.

MSC:

60G40 Stopping times; optimal stopping problems; gambling theory

References:

[1] Arnold B.C., Records (1998)
[2] Baryshnikov Yu.M., The Annals of Applied Probability 11 pp 863– (2001) · Zbl 1021.60005 · doi:10.1214/aoap/1015345351
[3] Berezovsky B.A., The Best Choice Problem (1984)
[4] Bertoin J., Random Fragmentation and Coagulation Processes (2006) · Zbl 1107.60002 · doi:10.1017/CBO9780511617768
[5] Bertoin J., Bernoulli 8 pp 195– (2002)
[6] Bertoin J., Electronic Journal of Probability 9 pp 575– (2004)
[7] Bollobás B., Transactions of the American Mathematical Society 124 pp 59– (1991) · Zbl 0726.06001 · doi:10.2307/2001495
[8] DOI: 10.1214/aop/1176993237 · Zbl 0553.60047 · doi:10.1214/aop/1176993237
[9] DOI: 10.1214/aop/1019160340 · Zbl 1005.60055 · doi:10.1214/aop/1019160340
[10] Bruss F.T., Stochastic Processes and their Applications 96 pp 313– (2001) · Zbl 1005.60056 · doi:10.1016/S0304-4149(01)00122-3
[11] Devroye L., SIAM Journal on Computing 28 pp 409– (1999) · Zbl 0915.68089 · doi:10.1137/S0097539795283954
[12] Feller W., An Introduction to Probability Theory and its Applications 2 (1971) · Zbl 0219.60003
[13] DOI: 10.2307/2283044 · doi:10.2307/2283044
[14] DOI: 10.2307/3215349 · Zbl 0871.60038 · doi:10.2307/3215349
[15] Gnedin A.V., Stochastic Processes and their Applications 111 pp 317– (2004) · Zbl 1076.60043 · doi:10.1016/j.spa.2003.12.005
[16] Gnedin A.V., Sequential Analysis 24 pp 1– (2005) · doi:10.1081/SQA-200046823
[17] Gnedin, A., 2005, Counting the chain records, available at arXiv.
[18] Gnedin, A., 2006, Constrained exchangeable partitions, available at arXiv.
[19] Gnedin, A. and Miretskiy, D., 2005, Winning rate in the full information best-choice problem, available at arXiv.
[20] Gnedin A., The Annals of Probability 33 pp 445– (2005) · Zbl 1070.60034 · doi:10.1214/009117904000000801
[21] Goldie C.M., Handbook of Statistics Vol. 19, (Stochastic Processes: Theory and Methods) pp 277– (1999)
[22] DOI: 10.1214/aop/1176991421 · Zbl 0678.60001 · doi:10.1214/aop/1176991421
[23] DOI: 10.1016/S0304-4149(00)00048-X · Zbl 1047.60039 · doi:10.1016/S0304-4149(00)00048-X
[24] Nevzorov, V.B., 2001, Records. Transl. Math, Monographs, Providence, AMS.
[25] DOI: 10.2307/3214377 · Zbl 0693.60030 · doi:10.2307/3214377
[26] Pitman J., Probability Theory and Related Fields 102 pp 145– (1995) · Zbl 0821.60047 · doi:10.1007/BF01213386
[27] Samuels S.M., Purdue University, Statistics Department, Mimeo Series pp 82– (1982)
[28] Samuels S.M., Handbook of Sequential Analysis (1991)
[29] Samuels S.M., Advances in Applied Probability 36 pp 398– (2004) · Zbl 1071.60028 · doi:10.1239/aap/1086957578
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.