On the full information best-choice problem

Author:
  • AGAlexander V. Gnedin
    Alexander V. Gnedin

Abstract
We introduce the optimal stopping problem of an infinite sequence of records associated with a planar Poisson process. This problem serves as a limiting form of the classical full information best-choice problem. A link between the finite problem and its limiting form is established via embedding n i.i.d. observations into the planar process.

This publication has 5 references indexed in Scilit: