English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Tools annual

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Presents the access of premium content as premium feature

Premium Content

Global: Zendy Plus annual

Global: Zendy Free Plan

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

Query-Based Selection of Optimal Candidates under the Mallows Model