We study online variants of weighted bipartite matching on graphs and hypergraphs. In our
model for online matching, the vertices on the right-hand side of a bipartite graph are given …

In the classical prophet inequality, a gambler observes a sequence of stochastic rewards V
1,…, Vn and must decide, for each reward Vi, whether to keep it and stop the game or to …

Only recently progress has been made in obtaining o (log (rank))-competitive algorithms for
the matroid secretary problem. More precisely, Chakraborty and Lachish (2012) presented a …

The matroid secretary problem was introduced by Babaioff, Immorlica, and Kleinberg in
SODA 2007 as an online problem that was both mathematically interesting and had …

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 the Matroid Secretary Problem (MSP), the elements of the ground set of a Matroid are
revealed on-line one by one, each together with its value. An algorithm for the MSP is called …

Motivated by the growing interest in correlation-robust stochastic optimization, we
investigate stochastic selection problems beyond independence. Specifically, we consider …

Consider a gambler who observes a sequence of independent random numbers and is
allowed to stop at any time, claiming reward equal to the most recent observation. 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 α …

During the last decade, the matroid secretary problem (MSP) became one of the most
prominent classes of online selection problems. The interest in MSP is twofold: on the one …