Heuristic Methods for Optimal Coalition Structure Generation

Hussin, Amir Aatieff Amir; Fatima, Shaheen

doi:10.1007/978-3-319-59294-7_11

Cited by 4 publications

(4 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Complex, large‐scale systems and PFGs need good enough approximate solutions within a deadline instead of optimal solutions that take too long to produce the final solutions. For such settings, it is practical to use heuristic approaches that are capable of generating a good enough approximate solution within the permissible time 92 . In the literature, the heuristic approaches have been used for large‐scale applications of coalition formation.…”

Section: Analysis and Discussionmentioning

confidence: 99%

“…The time complexity of the algorithms that find optimal results is

O (3^{n})

28 . Instead of waiting for the optimal solution in some critical systems, agents need to respond quickly with a sub‐optimal result 92,132 . In these situations, a locally optimal solution would be better than a delayed globally optimal solution because the delay could result in an adverse effect on the situation 128 …”

Section: Methodsmentioning

confidence: 99%

“…28 Instead of waiting for the optimal solution in some critical systems, agents need to respond quickly with a sub-optimal result. 92,132 In these situations, a locally optimal solution would be better than a delayed globally optimal solution because the delay could result in an adverse effect on the situation. 128 (B5) Stability type: The stability of a coalition requires that the surplus is distributed among the coalition members in such a way that no agent (or a group of agents) wants to deviate from the assigned coalition.…”

Section: Features Of the Problem Solvermentioning

confidence: 99%

“…For such settings, it is practical to use heuristic approaches that are capable of generating a good enough approximate solution within the permissible time. 92 In the literature, the heuristic approaches have been used for large-scale applications of coalition formation. For example: (i) the GA for electronic marketplaces 40 (cf.…”

Section: Approaches Suitable For Large-scale Systemsmentioning

confidence: 99%

See 3 more Smart Citations

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

Section: Analysis and Discussionmentioning

confidence: 99%

“…The time complexity of the algorithms that find optimal results is