Skip to main content
Kent Academic Repository

CONAN: a heuristic strategy for concurrent negotiating agents

Alrayes, Bedour and Kafalı, Özgur and Stathis, Kostas (2014) CONAN: a heuristic strategy for concurrent negotiating agents. In: Proceedings of the 2014 international conference on Autonomous agents and multi-agent systems. AAMAS International Conference on Autonomous Agents and Multiagent Systems . ACM, New York, USA, pp. 1585-1586. ISBN 978-1-4503-2738-1. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided) (KAR id:65883)

The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided.

Abstract

We develop CONAN, a heuristic agent for concurrent bilateral negotiations in electronic markets that are open, dynamic and complex. Existing strategies often omit the factors determining when a market environment is open or how an agent evaluates progress in bilateral negotiations. Such omissions in turn damage the offer-making ability of an agent and consequently the number of successful negotiations that this agent can achieve. Negotiation experiments indicate that CONAN outperforms other agents that rely on the current state-of-the-art by a significant amount in terms of the utility gained during a negotiation.

Item Type: Book section
Subjects: Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming, > QA76.76.E95 Expert Systems (Intelligent Knowledge Based Systems)
Divisions: Divisions > Division of Computing, Engineering and Mathematical Sciences > School of Computing
Depositing User: Ozgur Kafali
Date Deposited: 04 Feb 2018 13:59 UTC
Last Modified: 05 Nov 2024 11:04 UTC
Resource URI: https://kar.kent.ac.uk/id/eprint/65883 (The current URI for this page, for reference purposes)

University of Kent Author Information

  • Depositors only (login required):

Total unique views for this document in KAR since July 2020. For more details click on the image.