An optimal algorithm for stopping on the element closest to the center of an interval - Archive ouverte HAL
Journal Articles Advances in Applied Mathematics Year : 2022

An optimal algorithm for stopping on the element closest to the center of an interval

Abstract

A decision maker observes a sequence of $n$ independent realizations from the uniform distribution on the unit interval. However, he does not observe the precise values of these realizations, but only their ranks relative to those that have appeared previously. The goal of the decision maker is to select the realization whose value is closest to $1/2$. A realization can only be selected at the moment of its appearance. We derive a stopping rule which maximizes the probability of achieving this goal, together with the asymptotic probability of success.
Fichier principal
Vignette du fichier
KKKS_Stopping.August5.2021.pdf (345.5 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-03462302 , version 1 (02-12-2021)

Identifiers

Cite

Małgorzata Sulkowska, Ewa Kubicka, Grzegorz Kubicki, Małgorzata Kuchta. An optimal algorithm for stopping on the element closest to the center of an interval. Advances in Applied Mathematics, 2022, 133, pp.102281. ⟨10.1016/j.aam.2021.102281⟩. ⟨hal-03462302⟩
65 View
133 Download

Altmetric

Share

More