English   español  
Please use this identifier to cite or link to this item: http://hdl.handle.net/10261/162977
Share/Impact:
Statistics
logo share SHARE logo core CORE   Add this article to your Mendeley library MendeleyBASE

Visualizar otros formatos: MARC | Dublin Core | RDF | ORE | MODS | METS | DIDL
Exportar a otros formatos:

Title

Using similarity criteria to make issue trade-offs in automated negotiations

AuthorsFaratin, Peyman; Sierra, Carles ; Jennings, Nicholas
KeywordsFuzzy similarity
Automated negotiation
Trade-off algorithm
Multi agent systems
Issue Date2002
PublisherElsevier
CitationArtificial Intelligence 142: 205- 237 (2002)
AbstractAutomated negotiation is a key form of interaction in systems that are composed of multiple autonomous agents. The aim of such interactions is to reach agreements through an iterative process of making offers. The content of such proposals are, however, a function of the strategy of the agents. Here we present a strategy called the trade-off strategy where multiple negotiation decision variables are traded-off against one another (e.g., paying a higher price in order to obtain an earlier delivery date or waiting longer in order to obtain a higher quality service). Such a strategy is commonly known to increase the social welfare of agents. Yet, to date, most computational work in this area has ignored the issue of trade-offs, instead aiming to increase social welfare through mechanism design. The aim of this paper is to develop a heuristic computational model of the trade-off strategy and show that it can lead to an increased social welfare of the system. A novel linear algorithm is presented that enables software agents to make trade-offs for multi-dimensional goods for the problem of distributed resource allocation. Our algorithm is motivated by a number of real-world negotiation applications that we have developed and can operate in the presence of varying degrees of uncertainty. Moreover, we show that on average the total time used by the algorithm is linearly proportional to the number of negotiation issues under consideration. This formal analysis is complemented by an empirical evaluation that highlights the operational effectiveness of the algorithm in a range of negotiation scenarios. The algorithm itself operates by using the notion of fuzzy similarity to approximate the preference structure of the other negotiator and then uses a hill-climbing technique to explore the space of possible trade-offs for the one that is most likely to be acceptable. © 2002 Elsevier Science B.V. All rights reserved.
URIhttp://hdl.handle.net/10261/162977
Identifiersdoi: 10.1016/S0004-3702(02)00290-4
issn: 0004-3702
Appears in Collections:(IIIA) Artículos
Files in This Item:
File Description SizeFormat 
AI2002_142(205-37).pdf275,53 kBAdobe PDFThumbnail
View/Open
Show full item record
Review this work
 

Related articles:


WARNING: Items in Digital.CSIC are protected by copyright, with all rights reserved, unless otherwise indicated.