Related papers: Some variations of the secretary problem
We study a long-run persuasion problem where a long-lived Sender repeatedly interacts with a sequence of short-lived Receivers who may adopt a misspecified model for belief updating. The Sender commits to a stationary information structure,…
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…
We explore a multiple-stage variant of the min-max robust selection problem with budgeted uncertainty that includes queries. First, one queries a subset of items and gets the exact values of their uncertain parameters. Given this…
Three variants of the statistical complexity function, which is used as a criterion in the problem of detection of a useful signal in the signal-noise mixture, are considered. The probability distributions maximizing the considered variants…
We study a decision-maker's problem of finding optimal monetary incentive schemes for retention when faced with agents whose participation decisions (stochastically) depend on the incentive they receive. Our focus is on policies constrained…
We analyze the secretary problem in the case that the $n$ ranked items arrive not in uniformly random order but rather according to a certain type of Luce distribution or according to a Mallows distribution on the set $S_n$ of permutations…
Convex sample approximations of chance-constrained optimization problems are considered, in which chance constraints are replaced by sets of sampled constraints. We propose a randomized sample selection strategy that allows tight bounds to…
In the weighted bipartite matching problem, the goal is to find a maximum-weight matching in a bipartite graph with nonnegative edge weights. We consider its online version where the first vertex set is known beforehand, but vertices of the…
We study the problem of solving Packing Integer Programs (PIPs) in the online setting, where columns in $[0,1]^d$ of the constraint matrix are revealed sequentially, and the goal is to pick a subset of the columns that sum to at most $B$ in…
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…
When recruiting job candidates, employers rarely observe their underlying skill level directly. Instead, they must administer a series of interviews and/or collate other noisy signals in order to estimate the worker's skill. Traditional…
Suppose a set of requests arrives online: each request gives some value $v_i$ if accepted, but requires using some amount of each of $d$ resources. Our cost is a convex function of the vector of total utilization of these $d$ resources.…
Generalizing a problem posed by Cover, we propose an adversarial game in which a permutation is incrementally constructed in a setting of partial information. As in the secretary problem, this permutation is exposed in stages via the…
We introduce the \textit{prophet inequality with uncertain acceptance} model, in which a decision maker sequentially observes a sequence of independent options, each characterized by a value $x_i$ and an acceptance probability $p_i$, both…
Suppose $N$ independent Bernoulli trials are observed sequentially at random times of a mixed binomial process. The task is to maximise, by using a nonanticipating stopping strategy, the probability of stopping at the last success. We focus…
In this paper the problem of selecting $p$ out of $n$ available items is discussed, such that their total cost is minimized. We assume that costs are not known exactly, but stem from a set of possible outcomes. Robust recoverable and…
We model the joint distribution of choice probabilities and decision times in binary choice tasks as the solution to a problem of optimal sequential sampling, where the agent is uncertain of the utility of each action and pays a constant…
Chance-constrained problems involve stochastic components in the constraints which can be violated with a small probability. We investigate the impact of different types of chance constraints on the performance of iterative search…
The stable marriage problem and its extensions have been extensively studied, with much of the work in the literature assuming that agents fully know their own preferences over alternatives. This assumption however is not always practical…
Consider a discrete-time optimal selection problem where one observes a sequence of independent Bernoulli trials and receives a nonnegative reward upon stopping on a success. The aim is to find a single-choice strategy that maximises the…