Multi-Agent Negotiation Optimization Based on Accelerating Chaos Search Method

摘要

Accompanying the development of Internet and the popularity of electronic commerce, agent negotiation has become an important problem we must deal with about how to conduct its optimization quickly and more efficiently. In this paper, we propose an accelerating chaos search method under the Bazaar negotiation model. This method can, by exploiting the ergodic property of the chaos motion, compress the searching area of the optimal variable and adjust the bifurcation parameter. It can also get the searching result faster and converge on the optimal solution in the whole field more efficiently. Simulative experimentation demonstrates obvious effect of this method.