Low-dimensional optimal stopping with rank-dependent loss
Sequential selection problems with independent observable scores and rank-dependent objectives are not reducible, in general, to dynamic optimisation over a state space of fixed dimension. We consider optimal stopping problems with truncated loss structures through the lens of the planar Poisson process, where self-similarity removes the time variable and the state is reduced to the $m$ lowest scores observed so far, rescaled to the initial time. For $m=1$ the optimal rule stops at the first record below a hyperbola, which is found by a sliding-window argument. For $m=2$ we derive the equations for the boundaries of the stopping sets of $1$-records and $2$-records, solve them explicitly on a part of the state space, and express the optimal values by quadratures. The value function and the optimal strategy are characterised by a static integro-differential equation. The optimal strategies are compared with simple low-parameter rules, which are close to optimality.
Authors
- ALEXANDER V. GNEDIN (ORCID: https://orcid.org/0000-0003-2781-8614)
- Marcos C. S. Carreira (ORCID: https://orcid.org/0000-0002-9235-3297)
Publication Details
- Journal
- arXiv (Cornell University)
- Published
- 2026-11-18
- DOI
- https://doi.org/10.48550/arxiv.2611.24713
- Primary Topic
- Optimization and Search Problems
- Type
- preprint