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 1/n of the whole resource.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Rosenchein, J.S., Zlotkin, G.: Rules of Encounter. MIT Press, London (1994)
Davis, R., Smith, R.: Negotiation as a Metaphor for Distributed Problem Solving. Artificial Intelligence 20(1), 63–109 (1983)
Steinhaus, H.: The problem of fair division. Econometrica 16, 101–104 (1948)
Brams, S.J., Taylor, A.D.: Fair Division: From cake-cutting to dispute resolution. Cambridge University Press, Cambridge (1996)
Biswas, A., Sen, S.: More than envy-free. In: The Working Papers of the AAAI 1999 Workshop on Negotiation: Settling Conflicts and Identifying Opportunities, pp. 44–49. AAAI Press, Menlo Park (1999)
Tasnadi, A.: A new proportional procedure for the n-person cake-cutting problem. Economics Bulletin 4, 1–3 (2003)
Robertson, J., Webb, W.: Cake-Cutting Algorithms: Be Fair if You Can. A.K. Peters, Nattick (1998)
Huhns, M.N., Malhotra, A.K.: Negotiating for Goods and Services. IEEE Internet Computing 3(4), 97–99 (1999)
Stewart, I.: Mathematical Recreations: Your Half ’s Bigger Than My Half!, December 1998, pp. 112–114. Scientific American (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Iyer, K., Huhns, M. (2005). Multiagent Negotiation for Fair and Unbiased Resource Allocation. In: Meersman, R., Tari, Z. (eds) On the Move to Meaningful Internet Systems 2005: CoopIS, DOA, and ODBASE. OTM 2005. Lecture Notes in Computer Science, vol 3760. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11575771_29
Download citation
DOI: https://doi.org/10.1007/11575771_29
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29736-9
Online ISBN: 978-3-540-32116-3
eBook Packages: Computer ScienceComputer Science (R0)