Adaptive negotiation agents for e-business
ICEC '05 Proceedings of the 7th international conference on Electronic commerce
Genetic algorithm for the personnel assignment problem with multiple objectives
Information Sciences: an International Journal
Guided local search as a network planning algorithm that incorporates uncertain traffic demands
Computer Networks: The International Journal of Computer and Telecommunications Networking
Towards a web services and intelligent agents-based negotiation system for B2B eCommerce
Electronic Commerce Research and Applications
Knowledge discovery for adaptive negotiation agents in e-marketplaces
Decision Support Systems
Mining Trading Partners' Preferences for Efficient Multi-Issue Bargaining in E-Business
Journal of Management Information Systems
Fuzzy algorithm for group decision making with participants having finite discriminating abilities
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans - Special section: Best papers from the 2007 biometrics: Theory, applications, and systems (BTAS 07) conference
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics - Special issue on human computing
Evolving best-response strategies for market-driven agents using aggregative fitness GA
IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews
Improving multi-agent negotiations using multi-objective PSO algorithm
KES-AMSTA'10 Proceedings of the 4th KES international conference on Agent and multi-agent systems: technologies and applications, Part I
Hi-index | 0.00 |
Negotiations are a special class of group decision-making problems that can be formulated as constrained optimization problems and are characterized by high degrees of conflict among the negotiation participants. A variety of negotiation support techniques have been used to help find solutions acceptable to all parties in a negotiation. The paper presents an approach that employs a genetic algorithm (GA) for finding acceptable solutions for multiparty multiobjective negotiations. The GA approach is consistent with the complex nature of real-world negotiations and is therefore capable of addressing more realistic negotiation scenarios than previous techniques in the literature allow. In addition to the traditional genetic operators of reproduction, crossover, and mutation, the search is enhanced with a new operator called trade. The trade operator simulates concessions that might be made by parties during the negotiation process. GA performance with the trade operator is compared to a traditional GA, nonlinear programming, a hill-climber, and a random search. Experimental results show the GA with the trade operator performs better than these other more traditional approaches