Anzeige
Erschienen in:
2005 | OriginalPaper | Buchkapitel
Multiagent Negotiation for Fair and Unbiased Resource Allocation
verfasst von : Karthik Iyer, Michael Huhns
Erschienen in: On the Move to Meaningful Internet Systems 2005: CoopIS, DOA, and ODBASE
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
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 1/
n
of the whole resource.