Reselection in the game of best choice

2026-07-29

AI Summary

This study addresses a variant of the classical secretary problem incorporating a candidate screening mechanism aimed at maximizing the probability of selecting the best candidate. By introducing a time-dependent filtering process on the candidate pool, the work leverages statistical properties of left-to-right maxima in inverse permutations to derive a novel combinatorial formulation of the Steck distribution and establishes an optimal stopping rule for the single-step filtering setting. Theoretical analysis reveals that the optimal strategy is non-position-dependent, thereby departing from the classical secretary problem framework. Although the asymptotic success probability remains $1/e$, the strategy’s switching point lies in the interval $(1/e,\, (1/e)+(1-1/e)y)$, where $y$ denotes the unfiltered proportion—marking a significant departure from traditional models. The approach integrates combinatorics, permutation statistics, optimal stopping theory, and determinant-based techniques.

Abstract

We investigate a remarkable probability distribution on the symmetric group, due to Steck from the early 1970's, arising from a natural process that intertwines continuous and discrete selections for the values and positions, respectively, of a permutation. Steck used a matrix determinant to express his distribution, whereas we contribute new combinatorial formulas for it in terms of "bottom-to-top maxima" (that are simply the left-to-right maxima of the inverse) permutation statistics. These formulas specialize, in the case of the identity permutation, to a result of Pitman--Stanley from the late 1990's. We then use the Steck distribution to define a game of best choice (secretary problem variation) that incorporates a filtering process for the pool of candidates over time. We solve the model for the case where there is a single filtering step. It turns out that the probability of winning the game under optimal play is similar to the classical model ($1/e$, asymptotically), but that the interviewer must employ a different (non-positional) strategy in order to attain it. The optimal strategy depends on the relationship between interview position and the next bottom-to-top maximum value after the filtering step. Among other results, we prove that the optimal strategy always transitions from rejection to acceptance between positions $(1/e)$ and $(1/e) + (1 - 1/e)y$ as a proportion of the total candidates considered, where $y$ is the proportion of unfiltered candidates.

Problem

• best choice problem
• secretary problem
• candidate filtering
• optimal strategy
• Steck distribution

Innovation

• Steck distribution
• best choice problem
• bottom-to-top maxima
• non-positional strategy
• candidate filtering