Related papers: The Unified Approach for the Best Choice Problem A…
In the Secretary Problem, one has to hire the best among n candidates. The candidates are interviewed, one at a time, at a random order, and one has to decide on the spot, whether to hire a candidate or continue interviewing. It is well…
We consider a decision-making problem to evaluate absolute ratings of alternatives that are compared in pairs according to two criteria, subject to box constraints on the ratings. The problem is formulated as the log-Chebyshev approximation…
We consider a variant of the secretary problem in which the candidates state their expected salary at the interview, which we assume is in accordance with their qualifications. The goal is for the employer to hire the best or the worst…
This paper proposes a reformulation of the scenario-based two-stage unit commitment problem under uncertainty that allows finding unit-commitment plans that perform reasonably well both in expectation and for the worst case realization of…
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…
We seek to take a different approach in deriving the optimal search policy for the repeated consumer search model found in Fishman and Rob (1995) with the main motivation of dropping the assumption of prior knowledge of the price…
In this article, we derive an iterative scheme through a quasi-Newton technique to capture robust weakly efficient points of uncertain multiobjective optimization problems under the upper set less relation. It is assumed that the set of…
The algebraic intersection type unification problem is an important component in proof search related to several natural decision problems in intersection type systems. It is unknown and remains open whether the algebraic intersection type…
Causal analysis may be affected by selection bias, which is defined as the systematic exclusion of data from a certain subpopulation. Previous work in this area focused on the derivation of identifiability conditions. We propose instead a…
Under large cardinal hypotheses beyond the Kunen inconsistency -- hypotheses so strong as to contradict the Axiom of Choice -- we solve several variants of the generalized continuum problem and identify structural features of the levels…
In this paper, we introduce a family of sequential decision-making problems, collectively termed the Keychain Problem, that involve exploring a set of actions to maximize expected payoff when only a subset of actions are available in each…
This paper reconsiders the problem of the absent-minded driver who must choose between alternatives with different payoff with imperfect recall and varying degrees of knowledge of the system. The classical absent-minded driver problem…
The \emph{Temp Secretary Problem} was recently introduced by Fiat et al. It is a generalization of the Secretary Problem, in which commitments are temporary for a fixed duration. We present a simple online algorithm with improved…
We take a unifying approach to single selection optimal stopping problems with random arrival order and independent sampling of items. In the problem we consider, a decision maker (DM) initially gets to sample each of $N$ items…
For $2\le k\in\mathbb{N}$, consider the following adaptation of the classical secretary problem. There are $k$ items at each of $n$ linearly ordered ranks. The $kn$ items are revealed, one item at a time, in a uniformly random order, to an…
The paper presents a study of local search heuristics in general and variable neighborhood search in particular for the resolution of an assignment problem studied in the practical work of universities. Here, students have to be assigned to…
The problem of identifying the best arm among a collection of items having Gaussian rewards distribution is well understood when the variances are known. Despite its practical relevance for many applications, few works studied it for…
A lot of problems, from fields like sparse signal processing, statistics, portfolio selection, and machine learning, can be formulated as a cardinality constraint optimization problem. The cardinality constraint gives the problem a discrete…
We study the problem of eliciting the preferences of a decision-maker through a moderate number of pairwise comparison queries to make them a high quality recommendation for a specific problem. We are motivated by applications in high…
The classical analysis of online algorithms, due to its worst-case nature, can be quite pessimistic when the input instance at hand is far from worst-case. Often this is not an issue with machine learning approaches, which shine in…