An optimal coalition formation among buyer agents based on a genetic algorithm

Authors:
Masaki Hyodo;Tokuro Matsuo;Takayuki Ito
Affiliations:
Center for Knowledge Science, Japan Advanced Institute of Science and Technology, Ishikawa, Japan;Center for Knowledge Science, Japan Advanced Institute of Science and Technology, Ishikawa, Japan;Center for Knowledge Science, Japan Advanced Institute of Science and Technology, Ishikawa, Japan
Venue:
IEA/AIE'2003 Proceedings of the 16th international conference on Developments in applied artificial intelligence
Year:
2003

Citing 3
Cited 4

Bidding clubs: institutionalized collusion in auctions

Proceedings of the 2nd ACM conference on Electronic commerce
A stable and efficient buyer coalition formation scheme for e-marketplaces

Proceedings of the fifth international conference on Autonomous agents
Searching for Optimal Coalition Structures

ICMAS '00 Proceedings of the Fourth International Conference on MultiAgent Systems (ICMAS-2000)

Forming Buyer Coalitions with Bundles of Items

KES-AMSTA '09 Proceedings of the Third KES International Symposium on Agent and Multi-Agent Systems: Technologies and Applications
Buyer coalitions on JADE platform

KES'11 Proceedings of the 15th international conference on Knowledge-based and intelligent information and engineering systems - Volume Part I
Forming buyer coalition scheme with connection of a coalition leader

Journal of Theoretical and Applied Electronic Commerce Research
A collaborative platform for buyer coalition: Introducing the Awareness-based Buyer Coalition (ABC) system

Information Systems Frontiers

Quantified Score

Hi-index	0.00

Visualization

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 sim The 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.