Buyer Coalitions with Bundles of Items by Using Genetic Algorithm

Boongasame, Laor; Sukstrienwong, Anon

doi:10.1007/978-3-642-04070-2_73

Cited by 8 publications

(1 citation statement)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…There are already several buyer coalition systems. Many works do not explicitly address the relationship attributes-namely, the general and algorithmic aspects of buyer coalitions with bundles of items [2][3][4][5], multi-attribute coalitions [6][7][8], the strategy [9], the marketing/distribution approach [10], the knowledge management perspective [11], the mechanisms [4,[12][13][14][15], and having incomplete information [16,17]. The second group of work explicitly addresses the relationship attributes, such as 'trust' and 'power' [18].…”

Section: Introductionmentioning

confidence: 99%

Blockchain-based Trusty Buyer Coalition Scheme Using A Group Signature

Boongasame

Chaising

Temdee

2021

JMM

Self Cite

View full text Add to dashboard Cite

Without trust, buyers may not join a coalition. Despite the tremendous need for trustworthy relationships in buyer coalitions, no current buyer coalition scheme explicitly tackles confidence issues with blockchain technology. This study proposes an algorithmic design, the blockchain-based trusty buyer coalition scheme, to satisfy the trust requirement among different actors while forming the coalition. All activities forming a coalition through a decentralized public ledger can be explicitly examined. Consequently, the proposed algorithm can ensure anonymity within a community, resulting in trusting relationships. Furthermore, the proposed algorithm can ensure correctness and accountability by recognizing misbehavior and enforcing alternative forms of punishment. Additionally, the discovered algorithm can be applied to mobile commerce applications.

show abstract

Section: Introductionmentioning

confidence: 99%

Blockchain-based Trusty Buyer Coalition Scheme Using A Group Signature

Boongasame

Chaising

Temdee

2021

JMM

Self Cite

View full text Add to dashboard Cite

show abstract

A survey on applications of coalition formation in multi‐agent systems

Sarkar

Malta

Dutta

2022

Concurrency and Computation

View full text Add to dashboard Cite

The objective of coalition formation is to partition the agent set that gives the highest utility to the system. Over the past three decades, the process of coalition formation has been applied to various real-life applications where agents need to form efficient groups to accomplish a task. This article presents a study of the state-of-the-art approaches on the applications of coalition formation. In particular, it surveys the algorithmic approaches for optimizing the system's welfare. The algorithms are then analyzed based on a framework that consists of two dimensions: (i) the features of the problem environment, which gives an overview of the complexity level of the environment, and (ii) the features of the problem solver, which gives an overview of the solution quality. Our study analyses the approaches in terms of the framework mentioned above, justifies the use of the approaches in a particular problem setting, presents guidance to choose the right algorithmic approach for a problem at hand, and classifies the state-of-the-art approaches according to their basic working principles. This article also presents possible future directions of work to the research community. This study shows that theoretical models need more research before they can be deployed in the real world.

show abstract