E-Negotiation of Dependent Multiple Issues by Using a Joint Search Strategy

Negotiations have been a widespread research topic in politics, economics, and management for decades. Recently, with the rapid growth of on-line bargains, automatic negotiations have become more and more important. Although many automatic negotiation strategies have been presented, most of them are focused on simple negotiations composed of independent multiple issues. These strategies can not be applied to realistic complicated negotiations made up of dependent multiple issues. Therefore, we propose a mechanism named joint genetic algorithm (JGA) to deal with e-negotiations of dependent multiple issues. In JGA, a joint search strategy is applied to find the satisfactory contract accepted by both parties, by means of the genetic algorithm to predict and learn opponent´s preference. Experimental results show that JGA can facilitate to make a deal efficiently under different circumstances of conflict scenarios.