Abstract (EN)

Mechanisms for dividing a set of goods amongst a number of autonomous agents need to balance ef- ficiency and fairness requirements. A common in- terpretation of fairness is envy-freeness, while ef- ficiency is usually understood as yielding maximal overall utility. We show how to set up a distributed negotiation framework that will allow a group of agents to reach an allocation of goods that is both efficient and envy-free.