{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,5]],"date-time":"2026-01-05T18:37:24Z","timestamp":1767638244270,"version":"3.48.0"},"reference-count":32,"publisher":"Maximum Academic Press","issue":"2","license":[{"start":{"date-parts":[[2009,6,1]],"date-time":"2009-06-01T00:00:00Z","timestamp":1243814400000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["The Knowledge Engineering Review"],"published-print":{"date-parts":[[2009,6]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>\n                    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\n                    <jats:italic>criteria<\/jats:italic>\n                    , 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.\n                  <\/jats:p>","DOI":"10.1017\/s0269888909000204","type":"journal-article","created":{"date-parts":[[2009,5,20]],"date-time":"2009-05-20T06:09:18Z","timestamp":1242799758000},"page":"111-135","source":"Crossref","is-referenced-by-count":2,"title":["Negotiation criteria for multiagent resource allocation"],"prefix":"10.48130","volume":"24","author":[{"given":"Karthik","family":"Iyer","sequence":"first","affiliation":[]},{"given":"Michael N.","family":"Huhns","sequence":"additional","affiliation":[]}],"member":"27968","published-online":{"date-parts":[[2009,6,1]]},"reference":[{"volume-title":"Rules of Encounter: Designing Conventions for Automated Negotiation among Computers","year":"1994","author":"Rosenschein","key":"S0269888909000204_ref27"},{"key":"S0269888909000204_ref22","doi-asserted-by":"publisher","DOI":"10.1023\/A:1022232410606"},{"key":"S0269888909000204_ref11","doi-asserted-by":"publisher","DOI":"10.2307\/2296581"},{"key":"S0269888909000204_ref30","doi-asserted-by":"publisher","DOI":"10.2307\/2320951"},{"key":"S0269888909000204_ref21","unstructured":"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\u2013264."},{"key":"S0269888909000204_ref25","doi-asserted-by":"crossref","DOI":"10.4159\/9780674042605","volume-title":"Theory of Justice","author":"Rawls","year":"1971"},{"key":"S0269888909000204_ref6","doi-asserted-by":"publisher","DOI":"10.1016\/j.jet.2004.04.008"},{"key":"S0269888909000204_ref31","doi-asserted-by":"crossref","unstructured":"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\u2013213.","DOI":"10.1145\/800135.804414"},{"volume-title":"Data Networks","year":"1992","author":"Bertsekas","key":"S0269888909000204_ref3"},{"key":"S0269888909000204_ref7","first-page":"3","article-title":"Issues in multiagent resource allocation","volume":"30","author":"Chevaleyre","year":"2006","journal-title":"Informatica"},{"key":"S0269888909000204_ref4","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511598975"},{"key":"S0269888909000204_ref17","doi-asserted-by":"publisher","DOI":"10.1023\/A:1008746126376"},{"key":"S0269888909000204_ref2","doi-asserted-by":"publisher","DOI":"10.1002\/9781118164471"},{"key":"S0269888909000204_ref23","doi-asserted-by":"crossref","unstructured":"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\u2013607.","DOI":"10.1007\/3-540-36494-3_52"},{"key":"S0269888909000204_ref12","doi-asserted-by":"publisher","DOI":"10.2307\/2689255"},{"key":"S0269888909000204_ref24","doi-asserted-by":"publisher","DOI":"10.2307\/1883182"},{"key":"S0269888909000204_ref18","doi-asserted-by":"publisher","DOI":"10.2307\/3219163"},{"volume-title":"Multiagent Systems: A Modern Approach to Distributed Artificial Intelligence","year":"2000","author":"Weiss","key":"S0269888909000204_ref32"},{"key":"S0269888909000204_ref9","first-page":"91","article-title":"On the communication complexity of multilateral trading: extended report","volume":"11","author":"Endriss","year":"2005","journal-title":"Journal of Autonomous Agents and Multi-Agent Systems"},{"key":"S0269888909000204_ref29","doi-asserted-by":"publisher","DOI":"10.1038\/scientificamerican1298-112"},{"key":"S0269888909000204_ref5","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9939-97-03614-9"},{"key":"S0269888909000204_ref26","doi-asserted-by":"crossref","DOI":"10.1201\/9781439863855","volume-title":"Cake Cutting Algorithms","author":"Robertson","year":"1998"},{"key":"S0269888909000204_ref14","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.40.9.1174"},{"key":"S0269888909000204_ref16","unstructured":"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."},{"key":"S0269888909000204_ref8","doi-asserted-by":"publisher","DOI":"10.2307\/2311357"},{"key":"S0269888909000204_ref1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-6419.1994.tb00098.x"},{"key":"S0269888909000204_ref19","unstructured":"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\u201361."},{"key":"S0269888909000204_ref20","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(94)00021-R"},{"key":"S0269888909000204_ref13","unstructured":"FIPA. 2002. FIPA ACL Message Structure Specification. http:\/\/www.fipa.org\/specs\/fipa00061\/SC00061G.html"},{"key":"S0269888909000204_ref28","first-page":"101","article-title":"The problem of fair division","volume":"16","author":"Steinhaus","year":"1948","journal-title":"Econometrica"},{"key":"S0269888909000204_ref10","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(84)90005-2"},{"key":"S0269888909000204_ref15","doi-asserted-by":"crossref","unstructured":"Iyer K. Huhns M . 2005. Multiagent negotiation for fair and unbiased resource allocation. OTM Confederated International Conferences, CoopIS, DOA, and ODBASE 2005. Springer.","DOI":"10.1007\/11575771_29"}],"container-title":["The Knowledge Engineering Review"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0269888909000204","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,5]],"date-time":"2026-01-05T14:43:50Z","timestamp":1767624230000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0269888909000204\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,6]]},"references-count":32,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2009,6]]}},"alternative-id":["S0269888909000204"],"URL":"https:\/\/doi.org\/10.1017\/s0269888909000204","relation":{},"ISSN":["0269-8889","1469-8005"],"issn-type":[{"type":"print","value":"0269-8889"},{"type":"electronic","value":"1469-8005"}],"subject":[],"published":{"date-parts":[[2009,6]]}}}