Multiagent negotiation for fair and unbiased resource allocation

Karthik Iyer () and Michael Huhns

MPRA Paper from University Library of Munich, Germany

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.

Keywords: Utility theory; Utility function; Bargaining; Artificial intelligence; Resource allocation; Multiagent system (search for similar items in EconPapers)
JEL-codes: C78 F51 J52 (search for similar items in EconPapers)
Date: 2005-10
New Economics Papers: this item is included in nep-cmp, nep-knm and nep-upt
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1) Track citations by RSS feed

Downloads: (external link)
https://mpra.ub.uni-muenchen.de/145/1/MPRA_paper_145.pdf original version (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:pra:mprapa:145

Access Statistics for this paper

More papers in MPRA Paper from University Library of Munich, Germany Ludwigstraße 33, D-80539 Munich, Germany. Contact information at EDIRC.
Bibliographic data for series maintained by Joachim Winter ().