The secretary problem with items arriving according to a random permutation avoiding a pattern of length three

Ross G. Pinsky, Tomer Zilca

In the classical secretary problem, $n$ ranked items arrive one by one, and each item's rank relative to its predecessors is noted. The observer must select or reject each item as…