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 …

The secretary problem is probably the most well-studied optimal stop** problem with
many applications in economics and management. In the secretary problem, a decision …

In online sales, sellers usually offer each potential buyer a posted price in a take-it-or-leave
fashion. Buyers can sometimes see posted prices faced by other buyers, and changing the …

In the ordinal matroid secretary problem (MSP), candidates do not reveal numerical weights,
but the decision maker can still discern if a candidate is better than another. An algorithm α …

We take a unifying approach to single selection optimal stop** 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 …

The knapsack problem is one of the classical problems in combinatorial optimization: Given
a set of items, each specified by its size and profit, the goal is to find a maximum profit …

Suppose that n items arrive online in random order and the goal is to select k of them such
that the expected sum of the selected items is maximized. The decision for any item is …