Hostname: page-component-7b7567c8c-z4zkx Total loading time: 0 Render date: 2026-11-17T04:38:28.884Z Has data issue: false hasContentIssue false

Optimal Stopping with Rank-Dependent Loss

Published online by Cambridge University Press:  14 July 2016

Alexander V. Gnedin*
Affiliation:
Utrecht University
*
∗ Postal address: Department of Mathematics, Utrecht University, Postbus 80010, 3508 TA Utrecht, The Netherlands. Email address: gnedin@math.uu.nl
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

For τ, a stopping rule adapted to a sequence of n independent and identically distributed observations, we define the loss to be E[q(R τ)], where R j is the rank of the jth observation and q is a nondecreasing function of the rank. This setting covers both the best-choice problem, with q(r) = 1(r > 1), and Robbins' problem, with q(r) = r. As n tends to ∞, the stopping problem acquires a limiting form which is associated with the planar Poisson process. Inspecting the limit we establish bounds on the stopping value and reveal qualitative features of the optimal rule. In particular, we show that the complete history dependence persists in the limit; thus answering a question asked by Bruss (2005) in the context of Robbins' problem.

Information

Type
Research Papers
Copyright
Copyright © Applied Probability Trust 2007