Cart (Loading....) | Create Account
Close category search window

Novel dynamic diversity controlling EDA and its application to automated bilateral negotiation

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Jeonghwan Gwak ; Sch. of Inf. & Commun., Gwangju Inst. of Sci. & Technol., Gwangju, South Korea ; Kwang Mong Sim

Since optimal strategies ensure that agents negotiate optimally, finding optimal strategies for negotiation agents that have incomplete information is an important and challenging issue. In this study, we use estimation of distribution algorithms (EDAs) to find optimal strategies for a bilateral negotiation with incomplete information between two competitive negotiation agents by coevolving both the agents' strategies. Agents coevolve optimal negotiation strategies for both parties through an evolutionary learning process in which a coevolutionary interaction is performed by directly matching and interacting agents of one population with those of the other population through random pairing. Even though there have been studies on finding negotiation strategies using evolutionary approaches, there are very few works on effectively finding the global optimal solution. Finding both parties' optimal strategies is difficult because simple EDAs suffer from premature convergence and their search capability deteriorates during coevolution. To solve these problems, we previously proposed the dynamic diversity controlling EDA (D C-EDA), which has a novel dynamic diversity controlling capability. However, it suffers from the problem of population reinitialization that leads to a computational overhead. To reduce the computational overhead and to achieve further improvements in terms of solution accuracy, we have proposed an improved D2C-EDA (ID2C-EDA) by adopting a local neighborhood search. Favorable empirical results support the effectiveness of the proposed ID2CEDA.

Published in:

Bio-Inspired Computing: Theories and Applications (BIC-TA), 2010 IEEE Fifth International Conference on

Date of Conference:

23-26 Sept. 2010

Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.