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 study the greedy-based online algorithm for edge-weighted matching with (one-sided)
vertex arrivals in bipartite graphs, and edge arrivals in general graphs. This algorithm was …

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 …

The value maximization version of the secretary problem is the problem of hiring a candidate
with the largest value from a randomly ordered sequence of candidates. In this work, we …

In this paper, we investigate two variants of the secretary problem. In these variants, we are
presented with a sequence of numbers Xi that come from distributions Di, and that arrive in …

We consider three central problems in optimization: the restricted assignment load-
balancing problem, the Steiner tree network design problem, and facility location clustering …

We study a variation of the classical Pandora's problem in which a decision maker (DM)
sequentially explores alternatives from a given set and learns their values while trying to …

We study an online resource allocation problem under uncertainty about demand and about
the reward of each type of demand (agents) for the resource. Even though dealing with …

Makespan minimization on identical machines is a fundamental problem in online
scheduling. The goal is to assign a sequence of jobs to m identical parallel machines so as …

The secretary problem is one of the fundamental problems in online decision making; a tight
competitive ratio for this problem of $1/\mathrm {e}\approx 0.368$ has been known since the …