Hostname: page-component-77c78cf97d-lphnv Total loading time: 0 Render date: 2026-05-04T17:21:45.745Z Has data issue: false hasContentIssue false
  • English
  • Français

Negotiation criteria for multiagent resource allocation

Published online by Cambridge University Press:  01 June 2009

Karthik Iyer  and
Michael N. Huhns
Karthik Iyer*
Affiliation:
Department of Computer Science and Engineering, University of South Carolina, Columbia, SC 29208, USA
Michael N. Huhns*
Affiliation:
Department of Computer Science and Engineering, University of South Carolina, Columbia, SC 29208, USA
*
e-mail: iyerk0@gmail.com
huhns@engr.sc.edu
Get access Rights & Permissions [Opens in a new window]

Abstract

Negotiation in a multiagent system is a topic of active interest for enabling the allocation of scarce resources among autonomous agents. This paper presents a discussion of the research on negotiation criteria, which puts in context the contributions to resource allocation from the fields of economics, mathematics, and multiagent systems. We group the criteria based on how they relate to each other as well as their historical origin. In addition, we present three new criteria: verifiability, dimensionality, and topology. The criteria are organized into five categories. The allocation category contains criteria concerning fairness and envy-freeness with respect to how resources are allocated to agents. The protocol category covers criteria for stability, strategy-proofness, and communication costs. The procedure category includes criteria about the complexity of allocation procedures. The resource category has criteria for the properties that various resources can take and how they affect allocation. The paper concludes with a discussion of the criteria for agent utility functions. The overall objectives of this paper are (1) to create a starting point for protocol engineering by future negotiation designers and (2) to enumerate the criteria and their measures that enable negotiation and allocation mechanisms to be compared objectively.

Information

Type
Original Article
Information
The Knowledge Engineering Review , Volume 24 , Issue 2 , June 2009 , pp. 111 - 135
Copyright
Copyright © Cambridge University Press 2009

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable

References

Arnsperger, C. 1994. Envy-freeness and distributive justice. Journal of Economic Surveys 8(2), 155–186.CrossRefGoogle Scholar
Bartle, R. G. 1995. The Elements of Integration and Lebesgue Measure. Wiley-Interscience.CrossRefGoogle Scholar
Bertsekas, D. P., Gallager, R. G. 1992. Data Networks. Prentice Hall.Google Scholar
Brams, S. J., Taylor, A. D. 1996. Fair Division: From Cake-Cutting to Dispute Resolution. Cambridge University Press.CrossRefGoogle Scholar
Brams, S. J., Taylor, A. D., Zwicker, W. S. 1997. A moving-knife solution to the four-person envy-free cake-division problem. Proceedings of the American Mathematical Society 125(2), 547–554.CrossRefGoogle Scholar
Chambers, C. P. 2005. Allocation rules for land division. Journal of Economic Theory 121, 236–258.CrossRefGoogle Scholar
Chevaleyre, Y., Dunne, P. E., Endriss, U., Lang, J., Lemaitre, M., Maudet, N., Padget, J., Phelps, S., Rodriguez-Aguilar, J. A., Sousa, P. 2006. Issues in multiagent resource allocation. Informatica 30(1), 3–31.Google Scholar
Dubins, L. E., Spanier, E. H. 1961. How to cut a cake fairly. American Mathematical Monthly 68, 1–17.CrossRefGoogle Scholar
Endriss, U., Maudet, N. 2005. On the communication complexity of multilateral trading: extended report. Journal of Autonomous Agents and Multi-Agent Systems 11(1), 91–107.Google Scholar
Even, S., Paz, A. 1984. A note on cake cutting. Discrete Applied Mathematics 7, 285–296.CrossRefGoogle Scholar
Feldman, A. M. 1973. Bilateral trading, processes, pairwise optimality, and Pareto optimality. Review of Economic Studies 40(4), 463–473.CrossRefGoogle Scholar
Fink, A. M. 1964. A note on the fair division problem. Mathematics Magazine 37(5), 341–342.CrossRefGoogle Scholar
FIPA. 2002. FIPA ACL Message Structure Specification. http://www.fipa.org/specs/fipa00061/SC00061G.htmlGoogle Scholar
Fishburn, P. C., Sarin, R. K. 1994. Fairness and social risk I: unaggregated analyses. Management Science 40(9), 1174–1188.CrossRefGoogle Scholar
Iyer, K.Huhns, M. 2005. Multiagent negotiation for fair and unbiased resource allocation. OTM Confederated International Conferences, CoopIS, DOA, and ODBASE 2005. Springer.CrossRefGoogle Scholar
Iyer, K.Huhns, M. N. 2007. A Procedure for the Allocation of Two-Dimensional Resources in a Multiagent System. USC CSE Technical Report TR-2007-003, Department of Computer Science and Engineering, University of South Carolina.Google Scholar
Jennings, N. R., Faratin, P., Lomuscio, A. R., Parsons, S., Wooldridge, M. J., Sierra, C. 2001. Automated negotiation: prospects, methods and challenges. Group Decision and Negotiation 10(2), 199–215.CrossRefGoogle Scholar
Jones, M. A. 2002. Equitable, envy-free, and efficient cake cutting for two people and its application to divisible goods. Mathematics Magazine 75(4), 275–283.CrossRefGoogle Scholar
Kraus, S.Wilkenfield, J. 1991. Negotiations over time in a multiagent environment. In Proceedings of the 12th International Joint Conference on Artificial Intelligence. Morgan Kaufman, 56–61.Google Scholar
Kraus, S., Wilkenfeld, J., Zlotkin, G. 1995. Multiagent negotiation under time constraints. Artificial Intelligence 75(2), 297–345.CrossRefGoogle Scholar
Krumke, S., Lipmann, M., De Paepe, W. E., Poensgen, D., Rambau, J., Stougie, L.Woeginger, G. J. 2002. How to cut a cake almost fairly. In Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics, 263–264.Google Scholar
Lomuscio, A., Wooldridge, M., Jennings, N. R. 2003. A classification scheme for negotiation in electronic commerce. Group Decision and Negotiation 12(1), 31–56.CrossRefGoogle Scholar
Magdon-Ismail, M., Busch, C.Krishnamoorthy, M. 2003. Cake-cutting is not a piece of cake. In Proceedings of the 20th International Symposium on Theoretical Aspects of Computer Science. Springer, 596–607.Google Scholar
Pazner, E. A., Schmeidler, D. 1978. Egalitarian equivalent allocations: a new concept of economic equity. Quarterly Journal of Economics 92(4), 671–687.CrossRefGoogle Scholar
Rawls, J. 1971. Theory of Justice. Harvard University Press.CrossRefGoogle Scholar
Robertson, J., Webb, W. 1998. Cake Cutting Algorithms. A K Peters Ltd.CrossRefGoogle Scholar
Rosenschein, J. S., Zlotkin, G. 1994. Rules of Encounter: Designing Conventions for Automated Negotiation among Computers. MIT Press.Google Scholar
Steinhaus, H. 1948. The problem of fair division. Econometrica 16, 101–104.Google Scholar
Stewart, I. 1998. Your half’s bigger than my half! Scientific American 3(4), 112–114.CrossRefGoogle Scholar
Stromquist, W. 1980. How to cut a cake fairly. American Mathematical Monthly 87(8), 640–644.CrossRefGoogle Scholar
Weiss, G. (ed.) 2000. Multiagent Systems: A Modern Approach to Distributed Artificial Intelligence. The MIT Press.Google Scholar
Yao, A. C.-C. 1979. Some complexity questions related to distributive computing (Preliminary Report). In Proceedings of the eleventh annual ACM symposium on Theory of computing. ACM Press, 209–213.Google Scholar