Finding near-optimal strategies for negotiation with incomplete information using a diversity controlling EDA

Negotiation activities are carried out among stakeholders in a supply chain for resolving the differences in their objectives and preferences. The objective of this work is to find near-optimal negotiation strategies for bilateral negotiation with incomplete information, in which each agent has a competitive objective and incomplete information about its opponent, by coevolving both agents' strategies using an estimation of distribution algorithm (EDA). However, an EDA often cannot find optimum solutions for both the agents for the reason that one of the two agents' populations has a very rapid convergence rate than the other population in the process of coevolution. Hence, the resulting solutions of both the agents will be biased and converge to suboptimal ones. To solve this problem, this paper proposes an EDA which has a novel diversity controlling capability. The proposed method utilizes the accumulated frequency information of the occurrence of individuals in each band of a population for generations. The information is used in the diversification and refinement procedure of the proposed diversity controlling EDA. Results from a series of experiments indicate that the proposed diversity controlling EDA achieves a better performance than the EDA without a diversity controlling method for the problem task in finding near-optimal solutions.

[1]  Rasmus K. Ursem,et al.  Models for Evolutionary Algorithms and Their Applications in System Identification and Control Optimization , 2003 .

[2]  Rasmus K. Ursem,et al.  Diversity-Guided Evolutionary Algorithms , 2002, PPSN.

[3]  Nicholas R. Jennings,et al.  Optimal Negotiation Strategies for Agents with Incomplete Information , 2001, ATAL.

[4]  G. Marsaglia,et al.  The Ziggurat Method for Generating Random Variables , 2000 .

[5]  Kalyanmoy Deb,et al.  Self-adaptive simulated binary crossover for real-parameter optimization , 2007, GECCO '07.

[6]  Kwang Mong Sim,et al.  Equilibria, prudent Compromises,and the "Waiting" game , 2005, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[7]  David E. Goldberg,et al.  A Survey of Optimization by Building and Using Probabilistic Models , 2002, Comput. Optim. Appl..

[8]  Kwang Mong Sim,et al.  BLGAN: Bayesian Learning and Genetic Algorithm for Supporting Negotiation With Incomplete Information , 2009, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[9]  Isabelle Bloch,et al.  Estimation of Distribution Algorithms: A New Evolutionary Computation Approach for Graph Matching Problems , 2001, EMMCVPR.

[10]  David B. Fogel,et al.  An introduction to simulated evolutionary optimization , 1994, IEEE Trans. Neural Networks.

[11]  Kwang Mong Sim,et al.  Adaptive bargaining agents that negotiate optimally and rapidly , 2007, 2007 IEEE Congress on Evolutionary Computation.

[12]  N. R. Jennings,et al.  To appear in: Int Journal of Group Decision and Negotiation GDN2000 Keynote Paper Automated Negotiation: Prospects, Methods and Challenges , 2022 .

[13]  D. Lambert,et al.  SUPPLY CHAIN MANAGEMENT -- MORE THAN A NEW NAME FOR LOGISTICS , 1997 .

[14]  Kwang Mong Sim,et al.  A Market–Driven Model for Designing Negotiation Agents , 2002, Comput. Intell..

[15]  Kwang Mong Sim,et al.  An evolutionary approach for p-s-optimizing negotiation , 2008, 2008 IEEE Congress on Evolutionary Computation (IEEE World Congress on Computational Intelligence).

[16]  Kuo-Ming Chao,et al.  Negotiating Agents in a Market-Oriented Grid , 2002, 2nd IEEE/ACM International Symposium on Cluster Computing and the Grid (CCGRID'02).

[17]  Kwang Mong Sim,et al.  Agents that react to changing market situations , 2003, IEEE Trans. Syst. Man Cybern. Part B.