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

Bipartite-matching markets pair agents on one side of a market with agents, items, or
contracts on the opposing side. Prior work addresses online bipartite-matching markets …

We present a general framework for approximately reducing the mechanism design problem
for multiple agents to single agent subproblems in the context of Bayesian combinatorial …

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 stopping …

Optimal stopping 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 stopping rules …

Prophet inequalities are a useful tool for designing online allocation procedures and
comparing their performance to the optimal offline allocation. In the basic setting of k-unit …

Hill and Kertz studied the prophet inequality on iid distributions [The Annals of Probability
1982]. They proved a theoretical bound of 1-1/e on the approximation factor of their …

Employment outcomes of resettled refugees depend strongly on where they are placed
inside the host country. While the US sets refugee capacities for communities on an annual …

We consider Bayesian online selection problem of a matching in bipartite graphs, ie, online
weighted matching problem with edge arrivals where online algorithm knows distributions of …

We consider a class of online decision-making problems with exchangeable actions, where
in each period a controller is presented an input type drawn from some stochastic arrival …