Maximal Extractable Value (MEV) refers to excess value captured by miners (or validators)
from users in a cryptocurrency network. This excess value often comes from reordering …

Online Contention Resolution Schemes (OCRSs) represent a modern tool for selecting a
subset of elements, subject to resource constraints, when the elements are presented to the …

In the prophet secretary problem, n values are drawn independently from known
distributions and presented in a uniformly random order. A decision maker must accept or …

The design of online policies for stochastic matching and revenue management settings is
usually bound by the Bayesian prior that the demand process is formed by a fixed-length …

The classical prophet inequalities problem introduced by Krengel and Sucheston [1977,
1978] assumed complete knowledge of distributions. However, such an assumption may be …

Dynamic resource allocation problems are ubiquitous, arising in inventory management,
order fulfillment, online advertising, and other applications. We initially focus on one of the …

We study the polynomial-time approximability of the optimal online stochastic bipartite
matching algorithm, initiated by Papadimitriou et al.(EC'21). Here, nodes on one side of the …

We study a pricing problem where a seller has k identical copies of a product, buyers arrive
sequentially, and the seller prices the items aiming to maximize social welfare. When k= 1 …

This work introduces sharding and Poissonization as a unified framework for analyzing
prophet inequalities. Sharding involves splitting a random variable into several independent …

In this work, we revisit the multi-item order fulfillment model introduced by Jasin and Sinha
(2015). Specifically, we study a dynamic setting in which an e-commerce platform (or online …