Optimal Stopping with Rank-Dependent Loss

Details Optimal Stopping with Rank-Dependent Loss Optimal Stopping with Rank-Dependent Loss

2007-05-21

arxiv.org/abs/0705.2976v1

Mathematics

Probability

Scientific paper

For $\tau$ a stopping rule adapted to a sequence of $n$ iid observations, we define the loss to be $\ex [ q(R_\tau)]$, where $R_j$ is the rank of the $j$th observation, and $q$ is a nondecreasing function of the rank. This setting covers both the best choice problem with $q(r)={\bf 1}(r>1)$, and Robbins' problem with $q(r)=r$. As $n\to\infty$ 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 in the context of Robbins' problem.

Affiliated with

Also associated with

No associations

Rating

Optimal Stopping with Rank-Dependent Loss does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Optimal Stopping with Rank-Dependent Loss, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Optimal Stopping with Rank-Dependent Loss will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-335116