Article ID: | iaor201112694 |
Volume: | 27 |
Issue: | 2 |
Start Page Number: | 166 |
End Page Number: | 217 |
Publication Date: | May 2011 |
Journal: | Computational Intelligence |
Authors: | Lopez-Carmona Miguel A, Marsa-Maestre Ivan, De La Hoz Enrique, Velasco Juan R |
Keywords: | negotiation, utility, Pareto front |
Nonmonotonic utility spaces are found in multi-issue negotiations where the preferences on the issues yield multiple local optima. These negotiations are specially challenging because of the inherent complexity of the search space and the difficulty of learning the opponent’s preferences. Most current solutions successfully address moderately complex preference scenarios, while solutions intended to operate in highly complex spaces are constrained by very specific preference structures. To overcome these problems, we propose the Region-Based Multi-issue Negotiation Protocol (RBNP) for bilateral automated negotiation. RBNP is built upon a nonmediated recursive bargaining mechanism which efficiently modulates a region-based joint exploration of the solution space. We empirically show that RBNP produces outcomes close to the Pareto frontier in reasonable negotiation times, and show that it provides a significantly better performance when compared to a generic Similarity-Based Multi-issue Negotiation Protocol (SBNP), which has been successfully used in many negotiation models. We have paid attention to the strategic issues, proposing and evaluating several concession mechanisms, and analyzing the equilibrium conditions. Results suggest that RBNP may be used as a basis to develop negotiation mechanisms in nonmonotonic utility spaces.