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 …

We present a general framework for stochastic online maximization problems with
combinatorial feasibility constraints. The framework establishes prophet inequalities by …

The secretary and the prophet inequality problems are central to the field of Stop**
Theory. Recently, there has been a lot of work in generalizing these models to multiple items …

Over the past decade, an exciting connection has developed between the theory of posted-
price mechanisms and the prophet inequality, a result from the theory of optimal stop** …

We introduce a new rounding technique designed for online optimization problems, which is
related to contention resolution schemes, a technique initially introduced in the context of …

Optimal stop** theory is a powerful tool for analyzing scenarios such as online auctions in
which we generally require optimizing an objective function over the space of stop** rules …

We study generalizations of the``Prophet Inequality''and``Secretary Problem'', where the
algorithm is restricted to an arbitrary downward-closed set system. For 0, 1 values, we give O …

We introduce a novel framework of Prophet Inequalities for combinatorial valuation
functions. For a (n on-monotone) submodular objective function over an arbitrary matroid …

We study single-sample prophet inequalities (SSPIs), ie, prophet inequalities where only a
single sample from each prior distribution is available. Besides a direct, and optimal, SSPI …

We introduce a new rounding technique designed for online optimization problems, which is
related to contention resolution schemes, a technique initially introduced in the context of …