We consider the problem of dividing limited resources to individuals arriving over T rounds.
Each round has a random number of individuals arrive, and individuals can be …

We survey a burgeoning and promising new research area that considers the online nature
of many practical fair division problems. We identify wide variety of such online fair division …

We consider the problem of dividing limited resources between a set of agents arriving
sequentially with unknown (stochastic) utilities. Our goal is to find a fair allocation-one that is …

We consider a practically motivated variant of the canonical online fair allocation problem: a
decision-maker has a budget of resources to allocate over a fixed number of rounds. Each …

Sequential decision-making algorithms are ubiquitous in the design and optimization of
large-scale systems due to their practical impact. The typical algorithmic paradigm ignores …

Combinatorial problems are notoriously hard decision-making problems to solve and
appear in many fields and industries. Examples include vehicle routing in logistics …