Evolutionary Algorithm Approach to Bilateral Negotiations
The Internet is quickly changing the way business-to-consumer and business-to-business commerce is conducted. The technology has created an opportunity to get beyond single-issue negotiation by determining sellers’ and buyers’ preferences across multiple issues, thereby creating possible joint gains for all parties. We develop simple multiple issue algorithms and heuristics that could be used in electronic auctions and electronic markets. In this study, we show how a genetic algorithm based technique, coupled with a simple heuristic can achieve good results in business negotiations. Outcome of the negotiations are evaluated on two dimensions: joint utility and number of exchanges of offers to reach a deal. The results are promising and indicate possible use of such approaches in actual electronic commerce systems.
KeywordsHybrid Genetic Algorithm Negotiation Strategy Simple Genetic Algorithm Bilateral Negotiation Conceder Strategy
Unable to display preview. Download preview PDF.
- 1.Camerer C., Behavioral Game Theory, Insights in Decision-making, Univ. of Chicago Press, Chicago, IL.Google Scholar
- 2.Faratin Peyman, Automated Service Negotiation Between Autonomous Computational Agents, University of London.Google Scholar
- 3.Goldberg D E, Genetic Algorithms in Search, Optimization and Machine Learning, 1989, Addison-Wesley.Google Scholar
- 4.Linhart P B, R Radner, and M A Satterthwaite, Bargaining with Incomplete Information, 1992.Google Scholar
- 5.Nash J, The Bargaining problem. Econometrica, 1950.Google Scholar
- 6.Nash J, Two person cooperative games. Econometrica, 1953.Google Scholar
- 7.Oliver R Jim, A Machine Learning Approach to Automated Negotiation and Prospects for Electronic Commerce.Google Scholar
- 8.Raiffa Howard, The Art and Science of Negotiation, 1982, Cambridge. Harvard University Press.Google Scholar