Related papers: Secretary Problem with quality-based payoff
We study the problem of selecting a member of a set of agents based on impartial nominations by agents from that set. The problem was studied previously by Alon et al. and Holzman and Moulin and has important applications in situations…
We consider a generalization of the secretary problem where contracts are temporary, and for a fixed duration. This models online hiring of temporary employees, or online auctions for re-usable resources. The problem is related to the…
This paper considers the ranking problem of candidates for a certain position based on ballot papers filled by voters. We suggest a ranking procedure of alternatives using cooperative game theory methods. For this, it is necessary to…
We consider a stochastic online problem where $n$ applicants arrive over time, one per time step. Upon arrival of each applicant their cost per time step is revealed, and we have to fix the duration of employment, starting immediately. This…
We present a number of positive and negative results for variants of the matroid secretary problem. Most notably, we design a constant-factor competitive algorithm for the "random assignment" model where the weights are assigned randomly to…
In learning-augmented online algorithms, predictions are usually valued for what they say: a value estimate, a solution, or an algorithmic recommendation. This paper shows that predictions can also be valuable solely due to their arrival…
Online advertising has motivated interest in online selection problems. Displaying ads to the right users benefits both the platform (e.g., via pay-per-click) and the advertisers (by increasing their reach). In practice, not all users click…
Optimal stopping theory is a powerful tool for analyzing scenarios such as online auctions in which we generally require optimizing an objective function over the space of stopping rules for an allocation process under uncertainty. Perhaps…
We consider the online problem in which an intermediary trades identical items with a sequence of n buyers and n sellers, each of unit demand. We assume that the values of the traders are selected by an adversary and the sequence is…
In the Prophet Secretary problem, samples from a known set of probability distributions arrive one by one in a uniformly random order, and an algorithm must irrevocably pick one of the samples as soon as it arrives. The goal is to maximize…
We solve the secretary problem in the case that the ranked items arrive in a statistically biased order rather than in uniformly random order. The bias is given by a Mallows distribution with parameter $q\in(0,1)$, so that higher ranked…
We consider a simple optimal probabilistic problem solving strategy that searches through potential solution candidates in a specific order. We are interested in what impact has interchanging the order of two solution candidates with…
A version of the secretary problem called the duration problem, in which the objective is to maximize the time of possession of relatively best objects or the second best, is treated. It is shown that in this duration problem there are…
In the Sequential Selection Problem (SSP), immediate and irrevocable decisions need to be made as candidates randomly arrive for a job interview. Standard SSP variants, such as the well-known secretary problem, begin with an empty selection…
The well-known secretary problem in sequential analysis and optimal stopping theory asks one to maximize the probability of finding the optimal candidate in a sequentially examined list under the constraint that accept/reject decisions are…
Motivated by online platforms such as job markets, we study an agent choosing from a list of candidates, each with a hidden quality that determines match value. The agent observes only a noisy ranking of the candidates plus a binary signal…
We study online secretary problems with returns in combinatorial packing domains with $n$ candidates that arrive sequentially over time in random order. The goal is to accept a feasible packing of candidates of maximum total value. In the…
A version of the secretary problem is considered. The ranks of items, whose values are independent, identically distributed random variables $X_1,X_2,...,X_n$ from a uniform distribution on $[0; 1]$, are observed sequentially by the grader.…
This paper studies Makespan Minimization in the secretary model. Formally, jobs, specified by their processing times, are presented in a uniformly random order. An online algorithm has to assign each job permanently and irrevocably to one…
Suppose a customer is faced with a sequence of fluctuating prices, such as for airfare or a product sold by a large online retailer. Given distributional information about what price they might face each day, how should they choose when to…