Related papers: The duration problem with multiple exchanges
In this paper, a new upper bound for the Multiple Knapsack Problem (MKP) is proposed, based on the idea of relaxing MKP to a {\em Bounded Sequential Multiple Knapsack Problem}, i.e., a multiple knapsack problem in which item sizes are…
In this paper, we investigate two variants of the secretary problem. In these variants, we are presented with a sequence of numbers $X_i$ that come from distributions $\mathcal{D}_i$, and that arrive in either random or adversarial order.…
We study the collective schedules problem, which consists in computing a one machine schedule of a set of tasks, knowing that a set of individuals (also called voters) have preferences regarding the order of the execution of the tasks. Our…
The classical secretary problem investigates the question of how to hire the best secretary from $n$ candidates who come in a uniformly random order. In this work we investigate a parallel generalizations of this problem introduced by…
We consider the secretary problem through the lens of learning-augmented algorithms. As it is known that the best possible expected competitive ratio is $1/e$ in the classic setting without predictions, a natural goal is to design…
This paper examines the integration of computational complexity into game theoretic models. The example focused on is the Prisoner's Dilemma, repeated for a finite length of time. We show that a minimal bound on the players' computational…
The secretary problem is probably the purest model of decision making under uncertainty. In this paper we ask which advice can we give the algorithm to improve its success probability? We propose a general model that unifies a broad range…
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 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…
Optimization of decision problems in stochastic environments is usually concerned with maximizing the probability of achieving the goal and minimizing the expected episode length. For interacting agents in time-critical applications,…
We study the problem of clustering sequences of unlabeled point sets taken from a common metric space. Such scenarios arise naturally in applications where a system or process is observed in distinct time intervals, such as biological…
In this paper we propose primal-dual algorithms for different variants of the online resource allocation problem with departures. In the basic variant, requests (items) arrive over time to a set of resources (knapsacks) and upon arrival,…
The multiple knapsack problem with grouped items aims to maximize rewards by assigning groups of items among multiple knapsacks, considering knapsack capacities. Either all items in a group are assigned or none at all. We propose algorithms…
In this paper, we consider multistopping problems for finite discrete time sequences $X_1,...,X_n$. $m$-stops are allowed and the aim is to maximize the expected value of the best of these $m$ stops. The random variables are neither assumed…
In this paper we introduce the hiring under uncertainty problem to model the questions faced by hiring committees in large enterprises and universities alike. Given a set of $n$ eligible candidates, the decision maker needs to choose the…
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…
Sequential allocation is a simple and widely studied mechanism to allocate indivisible items in turns to agents according to a pre-specified picking sequence of agents. At each turn, the current agent in the picking sequence picks its most…
We consider the problem in which n items arrive to a market sequentially over time, where two agents compete to choose the best possible item. When an agent selects an item, he leaves the market and obtains a payoff given by the value of…
The fundamental problem underlying all multi-criteria decision analysis (MCDA) problems is that of dominance between any two alternatives: "Given two alternatives A and B, each described by a set criteria, is A preferred to B with respect…
The Stable Roommates problem involves matching a set of agents into pairs based on the agents' strict ordinal preference lists. The matching must be stable, meaning that no two agents strictly prefer each other to their assigned partners. A…