The Secretary Problem with Independent Sampling

11/16/2020
by   Jose Correa, et al.
0

In the secretary problem we are faced with an online sequence of elements with values. Upon seeing an element we have to make an irrevocable take-it-or-leave-it decision. The goal is to maximize the probability of picking the element of maximum value. The most classic version of the problem is that in which the elements arrive in random order and their values are arbitrary. However, by varying the available information, new interesting problems arise. Also the case in which the arrival order is adversarial instead of random leads to interesting variants that have been considered in the literature. In this paper we study both the random order and adversarial order secretary problems with an additional twist. The values are arbitrary, but before starting the online sequence we independently sample each element with a fixed probability p. The sampled elements become our information or history set and the game is played over the remaining elements. We call these problems the random order secretary problem with p-sampling (ROSp for short) and the adversarial order secretary problem with p-sampling (AOSp for short). Our main result is to obtain best possible algorithms for both problems and all values of p. As p grows to 1 the obtained guarantees converge to the optimal guarantees in the full information case. In the adversarial order setting, the best possible algorithm turns out to be a simple fixed threshold algorithm in which the optimal threshold is a function of p only. In the random order setting we prove that the best possible algorithm is characterized by a fixed sequence of time thresholds, dictating at which point in time we should start accepting a value that is both a maximum of the online sequence and has a given ranking within the sampled elements.

READ FULL TEXT

page 1

page 2

page 3

page 4

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/17/2019

Robust Algorithms for the Secretary Problem

In classical secretary problems, a sequence of n elements arrive in a un...
research
11/25/2021

Entropy-Based Approximation of the Secretary Problem

In this work we consider the well-known Secretary Problem – a number n o...
research
11/12/2020

Sample-driven optimal stopping: From the secretary problem to the i.i.d. prophet inequality

Two fundamental models in online decision making are that of competitive...
research
11/28/2022

Simple Random Order Contention Resolution for Graphic Matroids with Almost no Prior Information

Random order online contention resolution schemes (ROCRS) are structured...
research
09/18/2023

Simple and Optimal Online Contention Resolution Schemes for k-Uniform Matroids

We provide a simple (1-O(1/√(k)))-selectable Online Contention Resolutio...
research
11/15/2018

Secretary Ranking with Minimal Inversions

We study a twist on the classic secretary problem, which we term the sec...

Please sign up or login with your details

Forgot password? Click here to reset