Given that a negotiation outcome is determined to a large extent by the successive offers exchanged by negotiating agents, it is useful to analyze dynamic patterns of the bidding, what Raiffa calls the "negotiation danceδ. Patterns in such exchanges may provide additional insight into the strategies used by the agents. The current practice of evaluating a negotiation strategy, however, is to primarily focus on fairness and quality aspects of the agreement. There is a lack of tools and methods that facilitate a precise analysis of the negotiation dynamics. To fill this gap, this paper introduces a method for analysis based on a classification of negotiation steps. The method provides the basic tools to perform a detailed and quantified analysis of a negotiation between two agents in terms of dynamic properties of the negotiation trace. The method can be applied to well-designed tournaments, but can also be used to analyze single 1-on-1 negotiation. Example findings of applying the method to analyze the ABMP and Trade-Off strategies show that sensitivity to the preferences of the opponent is independent, respectively dependent, on a correct model of that opponent. Furthermore, the results illustrate that having domain knowledge is not always enough to avoid making unintentional steps.
|Title of host publication||Proceedings of the IEEE/WIC/ACM International Conference on Intelligent Agent Technology, IAT 2007|
|Number of pages||7|
|Publication status||Published - 28 May 2008|
|Event||IEEE Computer Society Technical Committee on Intelligent Informatics(TCII) - Fremont, CA, United States|
Duration: 2 Nov 2007 → 5 Nov 2007
|Conference||IEEE Computer Society Technical Committee on Intelligent Informatics(TCII)|
|Period||2/11/07 → 5/11/07|