ADDRESSING UTILITY SPACE COMPLEXITY IN NEGOTIATIONS INVOLVING HIGHLY UNCORRELATED, CONSTRAINT‐BASED UTILITY SPACES. (4th September 2012)

• Record Type: Journal Article
• Authors: Marsa‐Maestre, Ivan; Lopez‐Carmona, Miguel A.; Klein, Mark; Ito, Takayuki; Fujita, Katsuhide
• Is Part Of: Computational intelligence. Volume 30:Number 1(2014:Feb.)
• Page Start: 1
• Page End: 29
• Publication Date: 2012-09-04
• Subjects: Artificial intelligence -- Periodicals; Computational linguistics -- Periodicals; 006.3
• DOI: 10.1111/j.1467-8640.2012.00461.x
• Languages: English
• ISSNs: 0824-7935

Abstract

<abstract abstract-type="main" xml:lang="en"> <title> <x xml:space="preserve">Abstract</x> </title> <p>There is an increasing interest in complex automated negotiations, where agents negotiate about multiple, interdependent issues and agent utility functions exhibit low autocorrelation. In these scenarios, the negotiation mechanisms used to find agreement solutions among agents tend to fail due to the complexity of agents' preference spaces, and this tendency increases as the degree of autocorrelation decreases. In this paper, we propose an automated negotiation model specially tailored for highly uncorrelated utility spaces based on weighted constraints. The model relies on a mediated, auction‐based interaction protocol and a set of heuristic mechanisms for bidding and deal identification. To address the challenges raised by highly uncorrelated utility spaces, we propose to use a quality factor, which allows agents to balance utility and deal probability when placing their bids or when searching for agreement regions among these bids. Experiments show that the proposed negotiation model achieves high optimality results and low failure rates even in negotiation scenarios involving highly uncorrelated utility spaces, thus outperforming previous approaches.</p> </abstract>