PP-2007-19: Allocating Goods on a Graph to Eliminate Envy

PP-2007-19: Chevaleyre, Yann and Endriss, Ulle and Maudet, Nicolas (2007) Allocating Goods on a Graph to Eliminate Envy. [Report]

Preview	Text (Full Text) PP-2007-19.text.pdf Download (104kB) | Preview
	Text (Abstract) PP-2007-19.abstract.txt Download (1kB)

Abstract

We introduce a distributed negotiation framework for multiagent
resource allocation where interactions between agents are limited by a
graph defining a negotiation topology. A group of agents may only
contract a deal if that group is fully connected according to the
negotiation topology. An important criterion for assessing the quality
of an allocation of resources, in terms of fairness, is envy-freeness:
an agent is said to envy another agent if it would prefer to swap
places with that other agent. We analyse under what circumstances a
sequence of deals respecting the negotiation topology may be expected
to converge to a state where no agent envies any of the agents it is
directly connected to. We also analyse the computational complexity of
a related decision problem, namely the problem of checking whether a
given negotiation state admits any deal that would both be beneficial
to every agent involved and reduce envy in the agent society.

Item Type:	Report
Report Nr:	PP-2007-19
Series Name:	Prepublication (PP) Series
Year:	2007
Uncontrolled Keywords:	multiagent resource allocation; fairness; envy-freeness
Depositing User:	Ulle Endriss
Date Deposited:	12 Oct 2016 14:36
Last Modified:	12 Oct 2016 14:36
URI:	https://eprints.illc.uva.nl/id/eprint/253

Actions (login required)

View Item