Efficient Methods for Automated Multi-Issue Negotiation: Negotiating over a Two-Part Tariff


Somefun, D. J. A., Gerding, E. H. and La Poutre, J. A. (2006) Efficient Methods for Automated Multi-Issue Negotiation: Negotiating over a Two-Part Tariff. International Journal of Intelligent Systems, 21, (1), 99-119.

Download

[img] PDF
Download (278Kb)

Description/Abstract

In this article, we consider the novel approach of a seller and customer negotiating bilaterally about a two-part tariff, using autonomous software agents. An advantage of this approach is that win-win opportunities can be generated while keeping the problem of preference elicitation as simple as possible. We develop bargaining strategies that software agents can use to conduct the actual bilateral negotiation on behalf of their owners. We present a decomposition of bargaining strategies into concession strategies and Pareto-efficient-search methods: Concession and Pareto-search strategies focus on the conceding and win-win aspect of bargaining, respectively. An important technical contribution of this article lies in the development of two Pareto-search methods. Computer experiments show, for various concession strategies, that the respective use of these two Pareto-search methods by the two negotiators results in very efficient bargaining outcomes while negotiators concede the amount specified by their concession strategy.

Item Type: Article
Keywords: Automated Negotiation, Bilateral Negotiation, Multi-issue Negotiation, Pareto-efficiency, Two-Part Tariff, Derivative Follower
Divisions: Faculty of Physical and Applied Science > Electronics and Computer Science > Agents, Interactions & Complexity
Item ID: 263435
Date Deposited: 14 Feb 2007
Last Modified: 20 Aug 2012 04:19
Contributors: Somefun, D. J. A. (Author)
Gerding, E. H. (Author)
La Poutre, J. A. (Author)
Date: January 2006
Status: Published
Further Information:Google Scholar
ISI Citation Count:1
URI: http://eprints.soton.ac.uk/id/eprint/263435

Actions (login required)

View Item View Item