Reaching Envy-free States in Distributed Negotiation Settings
Yann Chevaleyre, Ulle Endriss, Sylvia Estivie, Nicolas Maudet

Abstract:
Mechanisms for dividing a set of goods amongst a
number of autonomous agents need to balance efficiency
and fairness requirements. A common interpretation
of fairness is envy-freeness, while efficiency
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.