Munich Personal RePEc Archive

Multiagent negotiation for fair and unbiased resource allocation

Iyer, Karthik and Huhns, Michael (2005): Multiagent negotiation for fair and unbiased resource allocation. Published in: Lecture Notes in Computer Science , Vol. 3760, (October 2005): pp. 453-465.

[img]
Preview
PDF
MPRA_paper_145.pdf

Download (227Kb) | Preview

Abstract

This paper proposes a novel solution for the n agent cake cutting (resource allocation) problem. We propose a negotiation protocol for dividing a resource among n agents and then provide an algorithm for allotting portions of the resource. We prove that this protocol can enable distribution of the resource among n agents in a fair manner. The protocol enables agents to choose portions based on their internal utility function, which they do not have to reveal. In addition to being fair, the protocol has desirable features such as being unbiased and verifiable while allocating resources. In the case where the resource is two-dimensional (a circular cake) and uniform, it is shown that each agent can get close to l/n of the whole resource.

UB_LMU-Logo
MPRA is a RePEc service hosted by
the Munich University Library in Germany.