The secretary problem with non-uniform arrivals via a left-to-right-minimum exponentially tilted distribution

Abstract

We solve the secretary problem in the case that the ranked items arrive in a statistically biased order rather than in uniformly random order. The bias is given by the left-to-right-minimum exponentially tilted distribution with parameter q∈(0,∞). That is, for σ∈ Sn, Pn(σ) is proportional to qLR-n(σ), where the left-to-right minimum statistic LR-n is defined by LR-n(σ)=|\j∈[n]: σj=\σi:1 i j\\|,\ σ∈ Sn. For q∈(0,1), higher ranked items tend to arrive earlier than in the case of the uniform distribution, and for q∈(1,∞), they tend to arrive later. In the classical problem, the asymptotically optimal strategy is to reject the first Mn* items, where Mn* ne, and then to select the first item ranked higher than any of the first Mn* items (if such an item exists). This yields e-1 as the limiting probability of success. With the above bias on arrivals, we calculate the asymptotic behavior of the optimal strategy Mn* and the corresponding limiting probability of success, for all regimes of \qn\n=1∞. In particular, if the leading order asymptotic behavior of \qn\n=1∞ is at least 1 n, and if also its order is no more than o(n), then the limiting probability of success when using an asymptotically optimal strategy is e-1; otherwise, this limiting probability of success is greater than e-1. Also, the limiting fraction of numbers, n∞M*nn, that are summarily rejected by an asymptotically optimal strategy lies in (0,1) if and only if n∞qn∈(0,∞).

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…