The majority of multi-agent system implementations aim to optimise agents' policies with
respect to a single objective, despite the fact that many real-world problem domains are …

We study the dynamic fair division of indivisible goods. Suppose T items arrive online and
must be allocated upon arrival to one of n agents, each of whom has a value in [0, 1] for the …

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 the problem of allocating T indivisible items that arrive online to agents with
additive valuations. The allocation must satisfy a prominent fairness notion, envy-freeness …

Sharing computational resources amortizes cost and improves utilization and efficiency.
When agents pool their resources together, each becomes entitled to a portion of the shared …

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 study the fair division of items to agents supposing that agents can form groups. We thus
give natural generalizations of popular concepts such as envy-freeness and Pareto …

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 study the classic problem of fairly dividing a set of indivisible items among a set of
agents and consider the popular fairness notion of envy-freeness up to one item (EF1) …

We consider mechanisms for the online allocation of perishable resources such as energy
or computational power. The main application is electric vehicle charging where agents …