A Comparison of some Negotiation Algorithms using a Tournament-Based Approach

(2002) A Comparison of some Negotiation Algorithms using a Tournament-Based Approach At 3rd International Symposium on Multi-Agent Systems, Large Complex Systems, and E-Business (MALCEB 2002) IGT Colordruck GmbH., pp. 580-593.

WarningThere is a more recent version of this item available.


Download (53kB)
[img] Indexer Terms UNSPECIFIED
Download (8kB)


This paper provides some results and analysis of several negotiation algorithms. We have used a tournament-based approach to evaluation and applied this within a community of Buyers and Sellers in a simulated car hire scenario. An automated negotiation environment has been developed and the various negotiation algorithms made to compete against each other. In a single tournament, each algorithm was used as both a Buyer-negotiator and a Seller-negotiator. Each negotiating algorithm accommodates the parameters for negotiation as a set of desirable goals, represented as examples of product specifications. It was the task of each negotiating algorithm to get the best deal possible from every one of their opposites (i.e. Buyer versus Seller) in the sense of being close to the examples they were given as goals. One algorithm proved to be superior to the others against which it was made to compete.

Item Type: Conference or Workshop Item (UNSPECIFIED)
Additional Information: Event Dates: October 7th-10th, 2002
Keywords: multi-agent systems automated negotiation enterprise systems
ePrint ID: 256852
Date Deposited: 31 Oct 2002
Last Modified: 31 Mar 2016 13:57
Further Information:Google Scholar
URI: http://eprints.soton.ac.uk/id/eprint/256852

Available Versions of this Item

Actions (login required)

View Item View Item