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 study the fair division problem consisting in allocating one item per agent so as to avoid
(or minimize) envy, in a setting where only agents connected in a given network may …

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

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 …

When allocating indivisible resources or tasks, an envy-free allocation or equitable
allocation may not exist. We present a sufficient condition and an algorithm to achieve envy …

Computational social choice is an exciting interdisciplinary field at the intersection of
computer science and social choice theory. In this article, I discuss some current and new …

Fairly dividing a set of indivisible resources to a set of agents is of utmost importance in
some applications. However, after an allocation has been implemented the preferences of …

Stable matching problems with lower quotas are fundamental in academic hiring and
ensuring operability of rural hospitals. Only few tractable (polynomial-time solvable) cases of …

Election control encompasses attempts from an external agent to alter the structure of an
election in order to change its outcome. This problem is both a fundamental theoretical …