Zakaria Derbazi
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Zakaria Derbazi has a total of 2 co-authors. Here are the top co-authors by number of shared publications:
- Alexander Gnedin
Queen Mary, University of London, Mile End Road, United Kingdom
3 shared publications - Alexander Marynych
Department of Mathematics, Kyiv School of Economics, Kyiv, Ukraine
1 shared publication
Latest Publications
- Open Access
- 19 October 2024
- Published by Springer Nature in Mathematical Methods of Operations Research
- Vol. 101 (1) , 1-27
The last-success stopping problem with random observation times
Suppose N independent Bernoulli trials with success probabilities $$p_1, p_2,\ldots $$ 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$$ 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)$$ 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.- 19 October 2024
- Published by Springer Nature in Mathematical Methods of Operations Research
- Vol. 101 (1) , 1-27
Open AccessThe last-success stopping problem with random observation times
Suppose N independent Bernoulli trials with success probabilities $$p_1, p_2,\ldots $$ 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$$ 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)$$ 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. - 1 January 2024
- Published by Institute for Applied and Pure Mathematics (IMPA) in Latin American Journal of Probability and Mathematical Statistics
- Vol. 21 (2) , 1475-1493
Records in the Infinite Occupancy Scheme
- 1 January 2024
- Published by Institute for Applied and Pure Mathematics (IMPA) in Latin American Journal of Probability and Mathematical Statistics
- Vol. 21 (2) , 1475-1493
Records in the Infinite Occupancy Scheme
- Open Access
- 5 January 2022
- Published by MDPI AG in Mathematics
- Vol. 10 (1) , 158
Trapping the Ultimate Success
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.
- 5 January 2022
- Published by MDPI AG in Mathematics
- Vol. 10 (1) , 158
Open AccessTrapping the Ultimate Success
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.