Abstract
Group buying is a form of electronic commerce that is growing quickly. There are many group buying sites on the Internet. Group buying is a commercial transaction in which the unit price of goods changes with the number of buyers, and a buyer can purchase goods at a low price if many buyers participate in group buying. There are several group-buying sites that are selling similar (or the same) goods. Buyers are often distributed among these group-buying sites non-optimally. If we can optimally allocate buyers to several group buying sites, all buyers can buy a good at a lower price. possible that a participant can purchase the target or the simThe aim of this paper is to solve this optimal allocation problem by a Genetic Algorithm. Our method can effectively avoid the growth of fatal genes. In experiments, we compared our method with an exhaustive search algorithm and a brute search algorithm. The experimental results show that our algorithm can optimally allocate buyers in an efficient time.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
bidders. http://www.bidders.co.jp/
rakuten. http://www.rakuten.co.jp/groupbuy/
Varian 90. Varian, H. R.: Intermediate Microeconomics: A Modern Approach, 2nd ed. W. W. Norton & Company, 1990.
Matsuo 02. Matsuo, T. and Ito, T.: A Decision Support System for Group Buying based on Buyer’s Preferences in Electronic Commerce, in the proceedings of the Eleventh World Wide Web International Conference (WWW-2002), 2002.
Leyton-Brown 00. Layton-Brown, K., Shoham Y. and Tennenholtz, M.: Bidding Club: Institutionalized Collusion in Auction, in the proceeding of ACM Conference on Electronic Commerce(EC’00), pp253–259, 2000.
Yamamoto 01. Yamamoto, J. and Sycara, K.: A Stable and Efficient Buyer Coalition Formation Scheme for E-Marketplaces, presented at the Fifth International Conference on Autonomous Agents (Agents 2001) in Montreal Canada, May 28–June 1, 2001.
Sen 00. Sen, S. and Dutta, S.: Searching for optimal coalition structures, in Proceedings of the Fourth International Conference on Multiagent Systems (pages 286–292), held between July 7–12, 2000 in Boston, MA.
Matsumoto 97. Matsumoto, M., Kanoh, H. and Nishihara, S: Solving Constraint Satisfaction Problems by Hybrid Genetic Algorithms Based on Min-conflicts Heuristic,, pages 962–969, May 1997. (in Japanese).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hyodo, M., Matsuo, T., Ito, T. (2003). An Optimal Coalition Formation among Buyer Agents Based on a Genetic Algorithm. In: Chung, P.W.H., Hinde, C., Ali, M. (eds) Developments in Applied Artificial Intelligence. IEA/AIE 2003. Lecture Notes in Computer Science(), vol 2718. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45034-3_77
Download citation
DOI: https://doi.org/10.1007/3-540-45034-3_77
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40455-2
Online ISBN: 978-3-540-45034-4
eBook Packages: Springer Book Archive