Forming Buyer Coalitions with Bundles of Items

摘要

There are several existing buyer coalition schemes, but they do not consider bundles of items. This research presents an algorithm for forming a buyer coalition with bundles of items, called the GroupBuy-Package scheme, in order to maximize the total discount. Our simulation results show that the total discount of the coalitions in this scheme are close to that in the optimal scheme.