IDEAS home Printed from
   My bibliography  Save this paper

Multiagent negotiation for fair and unbiased resource allocation


  • Iyer, Karthik
  • Huhns, Michael


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.

Suggested Citation

  • Iyer, Karthik & Huhns, Michael, 2005. "Multiagent negotiation for fair and unbiased resource allocation," MPRA Paper 145, University Library of Munich, Germany.
  • Handle: RePEc:pra:mprapa:145

    Download full text from publisher

    File URL:
    File Function: original version
    Download Restriction: no

    References listed on IDEAS

    1. repec:ebl:ecbull:v:4:y:2003:i:33:p:1-3 is not listed on IDEAS
    Full references (including those not matched with items on IDEAS)

    More about this item


    Utility theory ; Utility function ; Bargaining ; Artificial intelligence ; Resource allocation ; Multiagent system;

    JEL classification:

    • F51 - International Economics - - International Relations, National Security, and International Political Economy - - - International Conflicts; Negotiations; Sanctions
    • J52 - Labor and Demographic Economics - - Labor-Management Relations, Trade Unions, and Collective Bargaining - - - Dispute Resolution: Strikes, Arbitration, and Mediation
    • C78 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Bargaining Theory; Matching Theory

    NEP fields

    This paper has been announced in the following NEP Reports:


    Access and download statistics


    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:pra:mprapa:145. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Joachim Winter). General contact details of provider: .

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.