Despite the variety of existing buyer coalition schemes in the current e-commerce literature, no existing coalition scheme discusses topics related to the relationship among buyers in the coalitions that occur asynchronously in databases. By adopting utilizing theoretical groundings of the Data mining, Trust model, and N-person game theory, the current article provides algorithmic design of a buyer coalition scheme with explicit focus given to the ‘support’, and ‘confidence’ attributes of the motivators and the ‘trust’ attribute of the invited guests or trustees. The execution of the proposed algorithmic design and its effectiveness compared to the situation where no relationship attributes in the past is explicitly considered, are demonstrated by using a scenario and associated simulation programs. Results from the simulation programs confirm that the proposed model provides additional discounts for the buyers regardless the number of buyers within the coalition, and with reducing costs in communication among motivators and trustees.

buyer coalition, N-person game theory, electronic commerce, data mining, trust model, algorithmic design.