Secretary Ranking with Minimal Inversions

11/15/2018
by   Sepehr Assadi, et al.
0

We study a twist on the classic secretary problem, which we term the secretary ranking problem: elements from an ordered set arrive in random order and instead of picking the maximum element, the algorithm is asked to assign a rank, or position, to each of the elements. The rank assigned is irrevocable and is given knowing only the pairwise comparisons with elements previously arrived. The goal is to minimize the distance of the rank produced to the true rank of the elements measured by the Kendall-Tau distance, which corresponds to the number of pairs that are inverted with respect to the true order. Our main result is a matching upper and lower bound for the secretary ranking problem. We present an algorithm that ranks n elements with only O(n^3/2) inversions in expectation, and show that any algorithm necessarily suffers Ω(n^3/2) inversions when there are n available positions. In terms of techniques, the analysis of our algorithm draws connections to linear probing in the hashing literature, while our lower bound result relies on a general anti-concentration bound for a generic balls and bins sampling process. We also consider the case where the number of positions m can be larger than the number of secretaries n and provide an improved bound by showing a connection of this problem with random binary trees.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/30/2013

Online Ranking: Discrete Choice, Spearman Correlation and Other Feedback

Given a set V of n objects, an online ranking system outputs at each tim...
research
06/29/2019

On the number of resolvable Steiner triple systems of small 3-rank

In a recent work, Jungnickel, Magliveras, Tonchev, and Wassermann derive...
research
03/02/2018

RankDCG: Rank-Ordering Evaluation Measure

Ranking is used for a wide array of problems, most notably information r...
research
11/16/2020

The Secretary Problem with Independent Sampling

In the secretary problem we are faced with an online sequence of element...
research
03/28/2019

Optimal Random Sampling from Distributed Streams Revisited

We give an improved algorithm for drawing a random sample from a large d...
research
01/25/2019

Finding a Mediocre Player

Consider a totally ordered set S of n elements; as an example, a set of ...
research
02/20/2018

Adaptive Sampling for Coarse Ranking

We consider the problem of active coarse ranking, where the goal is to s...

Please sign up or login with your details

Forgot password? Click here to reset