An Agent Bilateral Multi-issue Simultaneous Bidding Negotiation Protocol Based on Genetic Algorithm and Its Application in E-commerce

In agent bilateral multi-issue bidding negotiation protocol, how to make the negotiation agents gain satisfying result farthest and negotiate efficiently is a key issue. As for this problem, a genetic algorithm based on metropolis rule is present in the protocol and the algorithm is applied in bilateral multi-issue simultaneous bidding negotiation protocol in E-commerce. In the protocol, the negotiation agent can send the information of its issue range and the issue weight to the third party agent which it trusts, and then the third party agent use the genetic algorithm which is present in this paper to give the optimal result. In the protocol experiments, the two methods are used to compare. The first is simple genetic algorithm (SGA), the second is the genetic algorithm based on metropolis rule (MGA). The difference is the later algorithm adds the metropolis rule. The experiments show that the protocol present in this paper can help agents to negotiation more efficiently. In the end, the finite state figure of the protocol is present.