Secretary Problems: The Power of a Single Sample

08/19/2022
by   Pranav Nuti, et al.
0

In this paper, we investigate two variants of the secretary problem. In these variants, we are presented with a sequence of numbers X_i that come from distributions 𝒟_i, and that arrive in either random or adversarial order. We do not know what the distributions are, but we have access to a single sample Y_i from each distribution 𝒟_i. After observing each number, we have to make an irrevocable decision about whether we would like to accept it or not with the goal of maximizing the probability of selecting the largest number. The random order version of this problem was first studied by Correa et al. [SODA 2020] who managed to construct an algorithm that achieves a probability of 0.4529. In this paper, we improve this probability to 0.5009, almost matching an upper bound of ≃ 0.5024 which we show follows from earlier work. We also show that there is an algorithm which achieves the probability of ≃ 0.5024 asymptotically if no particular distribution is especially likely to yield the largest number. For the adversarial order version of the problem, we show that we can select the maximum number with a probability of 1/4, and that this is best possible. Our work demonstrates that unlike in the case of the expected value objective studied by Rubinstein et al. [ITCS 2020], knowledge of a single sample is not enough to recover the factor of success guaranteed by full knowledge of the distribution.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/06/2017

Prophet Secretary: Surpassing the 1-1/e Barrier

In the Prophet Secretary problem, samples from a known set of probabilit...
research
04/21/2020

Competing Optimally Against An Imperfect Prophet

Consider a gambler who observes the realizations of n independent, non-n...
research
12/10/2021

Collecting Coupons is Faster with Friends

In this note, we introduce a distributed twist on the classic coupon col...
research
08/18/2023

The Last Success Problem with a Single Sample

The last success problem is an optimal stopping problem that aims to max...
research
10/09/2019

Prophets, Secretaries, and Maximizing the Probability of Choosing the Best

Suppose a customer is faced with a sequence of fluctuating prices, such ...
research
11/22/2018

The Price of Uncertain Priors in Source Coding

We consider the problem of one-way communication when the recipient does...
research
07/13/2019

The Two-Sided Game of Googol and Sample-Based Prophet Inequalities

The secretary problem or the game of Googol are classic models for onlin...

Please sign up or login with your details

Forgot password? Click here to reset