Forming buyer coalitions with bundles of items

Simple item page
dc.contributor.authorBoongasame, Laor
dc.contributor.authorLeung, Ho Fung
dc.contributor.authorBoonjing, Veera
dc.contributor.authorChiu, Dickson K.W.
dc.date.accessioned2026-08-06T09:58:37Z
dc.date.available2026-08-06T09:58:37Z
dc.date.issued2009-09-10
dc.description.abstractThere 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 GroupBuyPackage 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. © 2009 Springer Berlin Heidelberg.
dc.identifier.citationLecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics, 5559 LNAI, 714-723, 2009
dc.identifier.doi10.1007/978-3-642-01665-3_72
dc.identifier.issn03029743
dc.identifier.other2-s2.0-69849083515
dc.identifier.urihttps://dspace.kmitl.ac.th/handle/123456789/2586
dc.sourceLecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics
dc.subjectBundles of items
dc.subjectCoalition formation
dc.subjectCooperative game theory
dc.subjectGroup buying
dc.titleForming buyer coalitions with bundles of items
dc.typeConference Paper

Files

Collections

Research