Min-k-Cut Coalition Structure Generation on Trust-Utility Relationship Graph
Trust relationships have an important effect on coalition formation. In many real scenarios, agents usually cooperate with others in their trusted social networks to form coalitions. Therefore, the trust value between agents should constrain the utility of forming coalitions when cooperating. At the...
Main Authors: | XiangLong Kong, XiangRong Tong, YingJie Wang |
---|---|
Format: | Article |
Language: | English |
Published: |
Hindawi-Wiley
2021-01-01
|
Series: | Wireless Communications and Mobile Computing |
Online Access: | http://dx.doi.org/10.1155/2021/8834879 |
Similar Items
-
Iterative Min Cut Clustering Based on Graph Cuts
by: Bowen Liu, et al.
Published: (2021-01-01) -
On Graphs of the Cone Decompositions for the Min-Cut and Max-Cut Problems
by: Vladimir Bondarenko, et al.
Published: (2016-01-01) -
Coalition structure generation over graphs
by: Voice, Thomas, et al.
Published: (2012) -
Introduction to coalitions in graphs
by: Teresa W. Haynes, et al.
Published: (2020-10-01) -
Cutting and Destroying Graphs using k-cuts
by: Lindström, Alfred Minh
Published: (2009)