On the best-choice prophet secretary problem

12/04/2020
by   Pranav Nuti, et al.
0

We study a variant of the secretary problem where candidates come from independent, not necessarily identical distributions known to us, and show that we can do at least as well as in the IID setting. This resolves a conjecture of Esfandiari et al.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/10/2019

Avoidable paths in graphs

We prove a recent conjecture of Beisegel et al. that for every positive ...
research
12/08/2021

Online Elicitation of Necessarily Optimal Matchings

In this paper, we study the problem of eliciting preferences of agents i...
research
04/23/2018

Small-Set Expansion in Shortcode Graph and the 2-to-2 Conjecture

Dinur, Khot, Kindler, Minzer and Safra (2016) recently showed that the (...
research
06/28/2013

Investigation of "Enhancing flexibility and robustness in multi-agent task scheduling"

Wilson et al. propose a measure of flexibility in project scheduling pro...
research
09/21/2017

Non-Depth-First Search against Independent Distributions on an AND-OR Tree

Suzuki and Niida (Ann. Pure. Appl. Logic, 2015) showed the following res...
research
09/16/2019

An Asymptotic Analysis on Generalized Secretary Problem

As a famous result, the “37% Law” for Secretary Problem has widely influ...
research
02/02/2021

On absolutely and simply popular rankings

Van Zuylen et al. introduced the notion of a popular ranking in a voting...

Please sign up or login with your details

Forgot password? Click here to reset