Compromising Adjustment Strategy Based on TKI Conflict Mode for Multi‐Times Bilateral Closed Negotiations. (23rd January 2017)

• Record Type: Journal Article
• Authors: Fujita, Katsuhide
• Is Part Of: Computational intelligence. Volume 34:Number 1(2018)
• Page Start: 85
• Page End: 103
• Publication Date: 2017-01-23
• Subjects: automated negotiation, TKI conflict model, multiagent systems, agreement technology; Artificial intelligence -- Periodicals; Computational linguistics -- Periodicals; 006.3
• DOI: 10.1111/coin.12107
• Languages: English
• ISSNs: 0824-7935

Abstract

Abstract : Bilateral multi‐issue closed negotiation is an important class for real‐life negotiations. Usually, negotiation problems have constraints such as a complex and unknown opponent's utility in real time, or time discounting. In the class of negotiation with some constraints, the effective automated negotiation agents can adjust their behavior depending on the characteristics of their opponents and negotiation scenarios. Recently, the attention of this study has focused on the interleaving learning with negotiation strategies from the past negotiation sessions. By analyzing the past negotiation sessions, agents can estimate the opponent's utility function based on exchanging bids. In this article, we propose a negotiation strategy that estimates the opponent's strategies based on the past negotiation sessions. Our agent tries to compromise to the estimated maximum utility of the opponent by the end of the negotiation. In addition, our agent can adjust the speed of compromise by judging the opponent's Thomas–Kilmann conflict mode and search for the Pareto frontier using past negotiation sessions. In the experiments, we demonstrate that the proposed agent has better outcomes and greater search technique for the Pareto frontier than existing agents in the linear and nonlinear utility functions.