{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T14:19:29Z","timestamp":1753885169202,"version":"3.41.2"},"reference-count":34,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2021,4,14]],"date-time":"2021-04-14T00:00:00Z","timestamp":1618358400000},"content-version":"vor","delay-in-days":103,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100002858","name":"China Postdoctoral Science Foundation","doi-asserted-by":"publisher","award":["2017M622691","2019T120732"],"award-info":[{"award-number":["2017M622691","2019T120732"]}],"id":[{"id":"10.13039\/501100002858","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62072392"],"award-info":[{"award-number":["62072392"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["onlinelibrary.wiley.com"],"crossmark-restriction":true},"short-container-title":["Wireless Communications and Mobile Computing"],"published-print":{"date-parts":[[2021,1]]},"abstract":"<jats:p>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 same time, most studies ignore the impact of the number of coalitions in coalition structure. In this paper, the coalition formation of trust\u2010utility relationship in social networks is researched. Each node represents an agent, and the trust\u2010utility networks that connect the agents constrain coalition formation. To solve the task assignment problem, this paper proposes a greedy algorithm which is based on the edge contraction. Under the premise of ensuring the agent\u2019s individually rationality, this algorithm simulates the formation process of coalitions between agents through continuous edge contraction and constrains the number of forming coalitions to <jats:italic>k<\/jats:italic> to solve the problem of coalition structure. Finally, the simulation results show that our algorithm has great scalability because of the ability of solving the coalition structure on a large\u2010scale agent set. It can meet the growing demand for data intensive applications in the Internet of things and artificial intelligence era. The quality of the solution is much higher than other algorithms, and the running time is negligible.<\/jats:p>","DOI":"10.1155\/2021\/8834879","type":"journal-article","created":{"date-parts":[[2021,4,14]],"date-time":"2021-04-14T20:24:12Z","timestamp":1618431852000},"update-policy":"https:\/\/doi.org\/10.1002\/crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Min\u2010<i>k<\/i>\u2010Cut Coalition Structure Generation on Trust\u2010Utility Relationship Graph"],"prefix":"10.1155","volume":"2021","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5417-401X","authenticated-orcid":false,"given":"XiangLong","family":"Kong","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4855-3723","authenticated-orcid":false,"given":"XiangRong","family":"Tong","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0920-9305","authenticated-orcid":false,"given":"YingJie","family":"Wang","sequence":"additional","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2021,4,14]]},"reference":[{"key":"e_1_2_10_1_2","doi-asserted-by":"publisher","DOI":"10.1111\/joes.12258"},{"key":"e_1_2_10_2_2","first-page":"329","article-title":"Computational coalition formation","volume":"6","author":"Elkind E.","year":"2013","journal-title":"Annals of Nuclear Energy"},{"key":"e_1_2_10_3_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(99)00036-3"},{"key":"e_1_2_10_4_2","doi-asserted-by":"publisher","DOI":"10.1613\/jair.2695"},{"key":"e_1_2_10_5_2","doi-asserted-by":"publisher","DOI":"10.1287\/moor.2.3.225"},{"key":"e_1_2_10_6_2","doi-asserted-by":"crossref","unstructured":"HuangY. ChenM. CaiZ. GuanX. OhtsukiT. andZhangY. Graph theory based capacity analysis for vehicular ad hoc networks IEEE Global Telecommunications Conference (GLOBECOM 2015) December 2015 San Diego CA USA 1\u20135 https:\/\/doi.org\/10.1109\/GLOCOM.2015.7417561.","DOI":"10.1109\/GLOCOM.2015.7417561"},{"key":"e_1_2_10_7_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2018.10.034"},{"key":"e_1_2_10_8_2","doi-asserted-by":"publisher","DOI":"10.1109\/TNSE.2018.2830307"},{"key":"e_1_2_10_9_2","doi-asserted-by":"publisher","DOI":"10.1155\/2019\/2472783"},{"key":"e_1_2_10_10_2","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2020.2990428"},{"key":"e_1_2_10_11_2","doi-asserted-by":"publisher","DOI":"10.1002\/int.22371"},{"key":"e_1_2_10_12_2","doi-asserted-by":"publisher","DOI":"10.1109\/TDSC.2016.2613521"},{"key":"e_1_2_10_13_2","doi-asserted-by":"crossref","unstructured":"CaiZ.andHeZ. Trading private range counting over big IoT data 2019 IEEE 39th International Conference on Distributed Computing Systems (ICDCS) July 2019 Dallas TX USA https:\/\/doi.org\/10.1109\/ICDCS.2019.00023.","DOI":"10.1109\/ICDCS.2019.00023"},{"key":"e_1_2_10_14_2","doi-asserted-by":"publisher","DOI":"10.1109\/TII.2019.2911697"},{"key":"e_1_2_10_15_2","doi-asserted-by":"publisher","DOI":"10.1155\/2020\/2765491"},{"key":"e_1_2_10_16_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCSS.2020.2995760"},{"key":"e_1_2_10_17_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01935053"},{"key":"e_1_2_10_18_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2015.09.006"},{"key":"e_1_2_10_19_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10458-018-9386-z"},{"key":"e_1_2_10_20_2","doi-asserted-by":"crossref","unstructured":"WuF.andRamchurnS. D. Monte-Carlo tree search for scalable coalition formation Proceedings of the 29th International Joint Conference on Artificial Intelligence July 2020 Yokohama Japan 407\u2013413 https:\/\/doi.org\/10.24963\/ijcai.2020\/57.","DOI":"10.24963\/ijcai.2020\/57"},{"key":"e_1_2_10_21_2","doi-asserted-by":"crossref","unstructured":"AribS. AknineS. andCazenaveT. Nested Monte-Carlo search for multi-agent coalitions mechanism with constraints International Workshop on Multi-disciplinary Trends in Artificial Intelligence November 2015 Kuala Lumpur Malaysia 80\u201388 https:\/\/doi.org\/10.1007\/978-3-319-26181-2_8 2-s2.0-84952342570.","DOI":"10.1007\/978-3-319-26181-2_8"},{"key":"e_1_2_10_22_2","doi-asserted-by":"crossref","unstructured":"CaiZ. LinG. andXueG. Improved approximation algorithms for the capacitated multicast routing problem Proceedings of the 11th International Computing and Combinatorics Conference (COCOON 2005) August 2005 Kunming China 136\u2013145 https:\/\/doi.org\/10.1007\/11533719_16.","DOI":"10.1007\/11533719_16"},{"key":"e_1_2_10_23_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2009.05.013"},{"first-page":"363","volume-title":"Combinatorial Optimization and Applications. COCOA 2009. Lecture Notes in Computer Science, vol 5573","author":"Cai Z.","key":"e_1_2_10_24_2"},{"key":"e_1_2_10_25_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2009.05.031"},{"key":"e_1_2_10_26_2","unstructured":"VoiceT. D. RamchurnS. D. andJenningsN. R. On coalition formation with sparse synergies Proceedings of the 11th International Con-ference on Autonomous Agents and Multiagent Systems (AAMAS 2012) June 2012 Valencia Spain 223\u2013230."},{"key":"e_1_2_10_27_2","doi-asserted-by":"publisher","DOI":"10.1145\/3040967"},{"key":"e_1_2_10_28_2","doi-asserted-by":"crossref","unstructured":"GhaffariM. NowickiK. andThorupM. Faster algorithms for edge connectivity via random 2-out contractions Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms January 2020 Salt Lake City UT USA 1260\u20131279 https:\/\/doi.org\/10.1137\/1.9781611975994.77.","DOI":"10.1137\/1.9781611975994.77"},{"key":"e_1_2_10_29_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2018.03.004"},{"key":"e_1_2_10_30_2","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2019.2955652"},{"key":"e_1_2_10_31_2","doi-asserted-by":"publisher","DOI":"10.1155\/2019\/6452157"},{"key":"e_1_2_10_32_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.jnca.2015.04.007"},{"key":"e_1_2_10_33_2","unstructured":"Br\u00e2nzeiS.andLarsonK. Coalitional affinity games Proceedings of the 8th International Joint Conference on Autonomous Agents and Multi-agent Systems (AAMAS 2009) May 2009 Budapest Hungary 1319\u20131320."},{"key":"e_1_2_10_34_2","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539792251730"}],"container-title":["Wireless Communications and Mobile Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/wcmc\/2021\/8834879.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/wcmc\/2021\/8834879.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1155\/2021\/8834879","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,7]],"date-time":"2024-08-07T11:28:06Z","timestamp":1723030086000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1155\/2021\/8834879"}},"subtitle":[],"editor":[{"given":"Maode","family":"Ma","sequence":"additional","affiliation":[]}],"short-title":[],"issued":{"date-parts":[[2021,1]]},"references-count":34,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,1]]}},"alternative-id":["10.1155\/2021\/8834879"],"URL":"https:\/\/doi.org\/10.1155\/2021\/8834879","archive":["Portico"],"relation":{},"ISSN":["1530-8669","1530-8677"],"issn-type":[{"type":"print","value":"1530-8669"},{"type":"electronic","value":"1530-8677"}],"subject":[],"published":{"date-parts":[[2021,1]]},"assertion":[{"value":"2020-08-28","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-03-13","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-04-14","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}],"article-number":"8834879"}}