The University of Southampton
University of Southampton Institutional Repository

An adaptive bilateral negotiation model for e-commerce settings

An adaptive bilateral negotiation model for e-commerce settings
An adaptive bilateral negotiation model for e-commerce settings
This paper studies adaptive bilateral negotiation between software agents in e-commerce environments. Specifically, we assume that the agents are self-interested, the environment is dynamic, and both agents have deadlines. Such dynamism means that the agents’ negotiation parameters(such as deadlines and reservation prices) are functions of both the state of the encounter and the environment. Given this, we develop an algorithm that the negotiating agents can use to adapt their strategies to changes in the environment in order to reach an agreement within their specific deadlines and before the resources available for negotiation are exhausted. In more detail, we formally define an adaptive negotiation model and cast it as a Markov Decision Process. Using a value iteration algorithm, we then indicate a novel solution technique for determining optimal policies for the negotiation problem without explicit knowledge of the dynamics of the system. We also solve a representative negotiation decision problem using this technique and show that it is a promising approach for analyzing negotiations in dynamic settings. Finally, through empirical evaluation, we show that the agents using our algorithm learn a negotiation strategy that adapts to the environment and enables them to reach agreements in a timely manner.
34-39
Narayanan, V.
1426d816-1ac5-4394-8a0a-ce221de6faa5
Jennings, N. R.
ab3d94cc-247c-4545-9d1e-65873d6cdb30
Narayanan, V.
1426d816-1ac5-4394-8a0a-ce221de6faa5
Jennings, N. R.
ab3d94cc-247c-4545-9d1e-65873d6cdb30

Narayanan, V. and Jennings, N. R. (2005) An adaptive bilateral negotiation model for e-commerce settings. 7th Int. IEEE Conf. on E-Commerce Technology, Munich, Germany. pp. 34-39 .

Record type: Conference or Workshop Item (Paper)

Abstract

This paper studies adaptive bilateral negotiation between software agents in e-commerce environments. Specifically, we assume that the agents are self-interested, the environment is dynamic, and both agents have deadlines. Such dynamism means that the agents’ negotiation parameters(such as deadlines and reservation prices) are functions of both the state of the encounter and the environment. Given this, we develop an algorithm that the negotiating agents can use to adapt their strategies to changes in the environment in order to reach an agreement within their specific deadlines and before the resources available for negotiation are exhausted. In more detail, we formally define an adaptive negotiation model and cast it as a Markov Decision Process. Using a value iteration algorithm, we then indicate a novel solution technique for determining optimal policies for the negotiation problem without explicit knowledge of the dynamics of the system. We also solve a representative negotiation decision problem using this technique and show that it is a promising approach for analyzing negotiations in dynamic settings. Finally, through empirical evaluation, we show that the agents using our algorithm learn a negotiation strategy that adapts to the environment and enables them to reach agreements in a timely manner.

Text
narayanan05.pdf - Other
Download (121kB)

More information

Published date: 2005
Venue - Dates: 7th Int. IEEE Conf. on E-Commerce Technology, Munich, Germany, 2005-01-01
Organisations: Agents, Interactions & Complexity

Identifiers

Local EPrints ID: 260816
URI: http://eprints.soton.ac.uk/id/eprint/260816
PURE UUID: a305d68d-de1d-4448-950e-ec28db7f14cd

Catalogue record

Date deposited: 29 Apr 2005
Last modified: 14 Mar 2024 06:43

Export record

Contributors

Author: V. Narayanan
Author: N. R. Jennings

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×