2016/03/12 by L. Bayon, L. Bayón, J. Grau +12
Computer Science · Decision Sciences · Mathematics · #Advanced Bandit Algorithms Research #Auction Theory and Applications #FOS: Mathematics #Optimization and Search Problems #Probability (math.PR) #math.PR
paper · pdf · doi:10.48550/arxiv.1603.03928
openalex publication_date 2016/03/12 · arxiv created 2016/03/19 · arxiv updated 2016/03/22 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We consider a variant of the secretary problem in which the candidates state their expected salary at the interview, which we assume is in accordance with their qualifications. The goal is for the employer to hire the best or the worst (cheapest), indifferent between the two cases. We focus on the complete information variant as well as on the cases when the number of applicants is a random variable with a uniform distribution U[1,n] or with a Poisson distribution of parameter λ. Moreover, we also study two variants of the original problem in which we consider payoffs depending on the number of conducted interviews.