arXiv Analytics

Sign in

arXiv:math/0602278 [math.PR]AbstractReferencesReviewsResources

Recognising the Last Record of a Sequence

Alexander Gnedin

Published 2006-02-13Version 1

We study the best-choice problem for processes which generalise the process of records from Poisson-paced i.i.d. observations. Under the assumption that the observer knows distribution of the process and the horizon, we determine the optimal stopping policy and for a parametric family of problems also derive an explicit formula for the maximum probability of recognising the last record.

Related articles: Most relevant | Search more
arXiv:1401.7197 [math.PR] (Published 2014-01-28)
On the Bellman function of Nazarov, Treil and Volberg
arXiv:math/0510568 [math.PR] (Published 2005-10-26, updated 2005-11-19)
Winning rate in the full-information best choice problem
arXiv:math/0511652 [math.PR] (Published 2005-11-27)
The Probability of a Run