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 study an online version of the max-min fair allocation problem for indivisible items. In this
problem, items arrive one by one, and each item must be allocated irrevocably on arrival to …

We consider a fair division setting in which items arrive one by one and are allocated to
agents via two existing mechanisms: LIKE and BALANCED LIKE. The LIKE mechanism is …

Ensuring fair and stable allocation of scarce resources is a fundamental challenge in a wide
range of applications. Examples of domains where these challenges manifest include …

We consider fair division problems where indivisible items arrive one by one in an online
fashion and are allocated immediately to agents who have additive utilities over these items …

We study the problem of dynamically allocating $ T $ indivisible items to $ n $ agents with
the restriction that the allocation is fair all the time. Due to the negative results to achieve …

Behavioural economists have shown that people are often averse to inequality and will
make choices to avoid unequal outcomes. In this paper, we consider how to allocate …

We study a new but simple model for online fair division in which indivisible items arrive one-
by-one and agents have monotone utilities over bundles of the items. We consider axiomatic …

Since initiated by Steinhaus at a meeting in Washington DC [Econometrica, 1948], fair
allocation has been broadly studied in the fields of economics, mathematics and computer …

School: Computer Science and Engineering Faculty: Engineering Title: Online fair division with
indivisible items (Offline) Fair Page 1 THE UNIVERSITY OF NEW SOUTH WALES …