Recent rapid advances in Artificial Intelligence (AI) and Machine Learning have raised many
questions about the regulatory and governance mechanisms for autonomous machines …

We consider the well-studied cake cutting problem in which the goal is to find an envy-free
allocation based on queries from n agents. The problem has received attention in computer …

Fair division considers the allocation of scarce resources among agents in such a way that
every agent gets a fair share. It is a fundamental problem in society and has received …

Recently fair division theory has emerged as a promising approach for allocation of multiple
computational resources among agents. While in reality agents are not all present in the …

Imagine a cake that must be divided between a group of gluttonous children. To complicate
matters, the cake is heterogeneous: two pieces of cake may differ in terms of their top**s …

Fairness is essential for human society, contributing to stability and productivity. Similarly,
fairness is also the key for many multi-agent systems. Taking fairness into multi-agent …

Cake cutting Page 1 78 CommuniCations of thE aCm | july 2013 | vol. 56 | no. 7 contributed
articles addressing some of the great challenges of the 21st century involves a thorough …

The fairness notion of maximin share (MMS) guarantee underlies a deployed algorithm for
allocating indivisible goods under additive valuations. Our goal is to understand when we …

We study fair allocation of indivisible goods to agents with unequal entitlements. Fair
allocation has been the subject of many studies in both divisible and indivisible settings. Our …

We study the mechanism design problem of allocating a set of indivisible items without
monetary transfers. Despite the vast literature on this very standard model, it still remains …