Reaching envy-free states in distributed negotiation settings
Year: 2007
Type: conference-paper
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. 1
Institutions: Lamsade, Université Paris Dauphine-PSL, University of Amsterdam
Language: English
Subfield: Economics and Econometrics
Domain: Social Sciences
Open Access status: green
OpenAlex ID: W2164681065
