Matching, capturing allocation of items to unit-demand buyers, or tasks to workers, or pairs of
collaborators, is a central problem in economics. Indeed, the growing prevalence of …

We provide prophet inequality algorithms for online weighted matching in general (non-
bipartite) graphs, under two well-studied arrival models, namely edge arrival and vertex …

We study the single-choice Prophet Inequality problem when the gambler is given access to
samples. We show that the optimal competitive ratio of $1/2$ can be achieved with a single …

A central object in optimal stopping theory is the single-choice prophet inequality for
independent, identically distributed random variables: given a sequence of random …

Motivated by the applications of rental services in e-commerce, we consider revenue
maximization in online assortment of reusable resources for a stream of arriving consumers …

The rich literature on online Bayesian selection problems has long focused on so-called
prophet inequalities, which compare the gain of an online algorithm to that of a" prophet" …

We study the prophet secretary problem, a well-studied variant of the classic prophet
inequality, where values are drawn from independent known distributions but arrive in …

Our main contribution is a general framework to design efficient polynomial time
approximation schemes (EPTAS) for fundamental stochastic combinatorial optimization …

We study the problem of designing mechanisms when agents' valuation functions are drawn
from unknown and correlated prior distributions. In particular, we are given a prior …

We study a two-stage stochastic matching problem motivated in part by applications in
online marketplaces used for ride hailing. Using a randomized primal-dual algorithm applied …