  We study the secretary problem in which rank-ordered lists are generated by
the Mallows model and the goal is to identify the highest-ranked candidate
through a sequential interview process which does not allow rejected candidates
to be revisited. The main difference between our formulation and existing
models is that, during the selection process, we are given a fixed number of
opportunities to query an infallible expert whether the current candidate is
the highest-ranked or not. If the response is positive, the selection process
terminates, otherwise, the search continues until a new potentially optimal
candidate is identified. Our optimal interview strategy, as well as the
expected number of candidates interviewed and the expected number of queries
used, can be determined through the evaluation of well-defined recurrence
relations. Specifically, if we are allowed to query $s-1$ times and to make a
final selection without querying (thus, making $s$ selections in total) then
the optimum scheme is characterized by $s$ thresholds that depend on the
parameter $\theta$ of the Mallows distribution but are independent on the
maximum number of queries.
