Related papers: The secretary problem with biased arrival order vi…
In the subject of optimal stopping, the classical secretary problem is concerned with optimally selecting the best of $n$ candidates when their relative ranks are observed sequentially. This problem has been extended to optimally selecting…
We propose the Pseudo-Mallows distribution over the set of all permutations of $n$ items, to approximate the posterior distribution with a Mallows likelihood. The Mallows model has been proven to be useful for recommender systems where it…
The decision-maker (DM) sequentially evaluates up to N of different, rankable options. DM must select exactly the best one at the moment of its appearance. In the process of searching, DM finds out with each applicant whether she is the…
The elements of a finite nonempty partially ordered set are exposed at independent uniform times in $[0,1]$ to a selector who, at any given time, can see the structure of the induced partial order on the exposed elements. The selector's…
The prophet secretary problem is a combination of the prophet inequality and the secretary problem, where elements are drawn from known independent distributions and arrive in uniformly random order. In this work, we design 1) a…
We revisit the knapsack-secretary problem (Babaioff et al.; APPROX 2007), a generalization of the classic secretary problem in which items have different sizes and multiple items may be selected if their total size does not exceed the…
In this paper we revisit the basic variant of the classical secretary problem. We propose a new approach in which we separate between an agent that evaluates the secretary performance and one that has to make the hiring decision. The…
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…
The secretary and the prophet inequality problems are central to the field of Stopping Theory. Recently, there has been a lot of work in generalizing these models to multiple items because of their applications in mechanism design. The most…
Suppose we are given integer $k \leq n$ and $n$ boxes labeled $1,\ldots, n$ by an adversary, each containing a number chosen from an unknown distribution. We have to choose an order to sequentially open these boxes, and each time we open…
We study various generalizations of the secretary problem with submodular objective functions. Generally, a set of requests is revealed step-by-step to an algorithm in random order. For each request, one option has to be selected so as to…
Many online problems are studied in stochastic settings for which inputs are samples from a known distribution, given in advance, or from an unknown distribution. Such distributions model both beyond-worst-case inputs and, when given,…
We consider a variant of the classical Secretary Problem. In this setting, the candidates are ranked according to some exchangeable random variable and the quest is to maximize the expected quality of the chosen aspirant. We find an upper…
The secretary problem is a classic model for online decision making. Recently, combinatorial extensions such as matroid or matching secretary problems have become an important tool to study algorithmic problems in dynamic markets. Here the…
The Santa Claus problem is a fundamental problem in fair division: the goal is to partition a set of heterogeneous items among heterogeneous agents so as to maximize the minimum value of items received by any agent. In this paper, we study…
We revisit three fundamental problems in algorithms under uncertainty: the Secretary Problem, Prophet Inequality, and Stochastic Probing, each subject to general downward-closed constraints. When elements have binary values, all three…
In the matroid secretary problem, the elements of a matroid $\mathcal{M}$ arrive in random order. Once we observe an item we need to irrevocably decide whether or not to accept it. The set of selected elements should form an independent set…
We consider a double secretary problem which contains $2n$ applicants of $n$ different qualities, two of each quality. As in the classical secretary problem (CSP), the applicants are interviewed sequentially in a random order by a manager…
The secretary problem or the game of Googol are classic models for online selection problems that have received significant attention in the last five decades. We consider a variant of the problem and explore its connections to data-driven…
The J-choice K-best secretary problem, also known as the (J,K)-secretary problem, is a generalization of the classical secretary problem. An algorithm for the (J,K)-secretary problem is allowed to make J choices and the payoff to be…